Filters








7,128 Hits in 4.9 sec

Call by name, assignment, and the lambda calculus

Martin Odersky, Dan Rabin, Paul Hudak
1993 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93  
We de ne an extension of the call-by-name lambda calculus with additional constructs and reduction rules that represent m utable variables and assignments.  ...  We also show that the new calculus has the Church-Rosser property and that it is a conservative extension of classical lambda calculus with respect to operational equivalence that is, all algebraic laws  ...  Acknowledgements This work was supported in part by D ARPA grant n umber N00014-91-J-4043. The second author was supported by an IBM Graduate Fellowship during the nal preparation of this paper.  ... 
doi:10.1145/158511.158521 dblp:conf/popl/OderskyRH93 fatcat:gr5todqrznazppb3eneudz4d7i

A Meta Lambda Calculus with Cross-Level Computation

Kazunori Tobisawa
2015 Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15  
We overcome the difficulty by introducing a new mechanism to deal with substitution and binding structure in a systematic way without the notion of free variables and α-renaming.  ...  We propose meta lambda calculus λ * as a basic model of textual substitution via metavariables.  ...  Acknowledgments The author wishes to thank his supervisor, Ryu Hasegawa, sincerely for the fruitful discussions. The author also thanks Brigitte Pientka and anonymous reviewers for helpful comments.  ... 
doi:10.1145/2676726.2676976 dblp:conf/popl/Tobisawa15 fatcat:c74zlkaz4nhtbmiyqrw4cw75vy

Let-Binding with Regular Expressions in Lambda Calculus

Takuya Ohata, Shin-ya Nishizaki
2016 Journal of Software  
We formalize this variable binding mechanism in the framework of the lambda calculus: we propose a lambda calculus with the regular expression let-bindings and a simple type system to the calculus in the  ...  We often give proper names to variables in programs based on their types, usages, and means, and the regularity and there are several kinds of conventions for variable-naming in programming languages.  ...  of the theoretical properties and supplementing the introduction and concluding remarks, essentially.  ... 
doi:10.17706/jsw.11.2.220-229 fatcat:oea32e5a3fdk5hf4tfzq5vnft4

Page 4931 of Mathematical Reviews Vol. , Issue 99g [page]

1999 Mathematical Reviews  
The theory is a strictly smaller theory than Plotkin’s call- by-name lambda calculus.  ...  In this paper we develop an equational characterization of the most popular lazy implementation technique—traditionally calledcall- by-need’—and prove it correct with respect to the original lambda calculus  ... 

Simplification of Abstract Machine for Functional Language and Its Theoretical Investigation

Shin Ya Nishizaki
2015 Journal of Software  
In this section, we define an abstract machine based on a call-by-value evaluation strategy, called, the Simple Abstract Machine (SAM).  ...  We study simplification of SECD machine and design a new abstract machine, called Simple Abstract Machine. We achieve the simplification of SECD machine by abstracting substitutions for variables.  ...  This work was supported by Grants-in-Aid for Scientific Research (C) (23400009).  ... 
doi:10.17706//jsw.10.10.1148-1159 fatcat:vqhwrvrm5rc3fjmyc5fa2mvtdu

Simplification of Abstract Machine for Functional Language and Its Theoretical Investigation

Shin-Ya Nishizaki, Kensuke Narita, Tomoyuki Ueda
2015 Journal of Software  
In this section, we define an abstract machine based on a call-by-value evaluation strategy, called, the Simple Abstract Machine (SAM).  ...  We study simplification of SECD machine and design a new abstract machine, called Simple Abstract Machine. We achieve the simplification of SECD machine by abstracting substitutions for variables.  ...  This work was supported by Grants-in-Aid for Scientific Research (C) (23400009).  ... 
doi:10.17706/jsw.10.10.1148-1159 fatcat:msoso6g3kzcbjhthuxyuumdsya

A call-by-need lambda calculus

Zena M. Ariola, John Maraist, Martin Odersky, Matthias Felleisen, Philip Wadler
1995 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95  
assignments. 1 In this paper we write \call-by-need" rather than \lazy" to avoid a name clash with the work of Abramsky 2], which d escribes call-by-name reduction to values. 2 Ironically, this problem  ...  In this paper we derive an equational characterization of call-by-need and prove it correct with respect to the original lambda calculus.  ...  Call-by-need and assignment Call-by-need can be implemented using assignments.  ... 
doi:10.1145/199448.199507 dblp:conf/popl/AriolaFMOW95 fatcat:syck6jhnzzextd4bvcwol4lvci

Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics [chapter]

Alex Simpson
2005 Lecture Notes in Computer Science  
, call-by-name and call-by-need contextual equivalences coincide.  ...  We apply these results to the operational semantics of Lily, a second-order linear lambda-calculus with recursion, introduced by Bierman, Pitts and Russo, for which we give simple proofs that call-by-value  ...  of) β-reduction simulates both call-by-value and call-by-name operational semantics.  ... 
doi:10.1007/978-3-540-32033-3_17 fatcat:4ueyxjhavbdmzks6mvxmkvkmc4

Control-flow analysis of dynamic languages via pointer analysis

Steven Lyde, William E. Byrd, Matthew Might
2015 Proceedings of the 11th Symposium on Dynamic Languages - DLS 2015  
We present the first mapping between a high-order control-flow analysis and a pointer analysis.  ...  This allows us to use existing pointer analysis tools to perform a control-flow analysis, exploiting their technical advancements and the engineering effort that went into developing them.  ...  Acknowledgments This material is partially based on research sponsored by DARPA under agreements number AFRL FA8750-15-2-0092 and by NSF under CAREER grant 1350344. The U.S.  ... 
doi:10.1145/2816707.2816712 dblp:conf/dls/LydeBM15 fatcat:b2fv45ukrne4reljevw4vuqhtm

Control-flow analysis of dynamic languages via pointer analysis

Steven Lyde, William E. Byrd, Matthew Might
2015 SIGPLAN notices  
We present the first mapping between a high-order control-flow analysis and a pointer analysis.  ...  This allows us to use existing pointer analysis tools to perform a control-flow analysis, exploiting their technical advancements and the engineering effort that went into developing them.  ...  Acknowledgments This material is partially based on research sponsored by DARPA under agreements number AFRL FA8750-15-2-0092 and by NSF under CAREER grant 1350344. The U.S.  ... 
doi:10.1145/2936313.2816712 fatcat:p5a6ps35nvhmdlif4t2soov22e

Demonstrating Lambda Calculus Reduction [chapter]

Peter Sestoft
2002 Lecture Notes in Computer Science  
We describe lambda calculus reduction strategies, such as call-by-value, call-by-name, normal order, and applicative order, using big-step operational semantics.  ...  We show how to simply and efficiently trace such reductions, and use this in a web-based lambda calculus reducer available at http://www.dina.kvl.dk/˜sestoft/lamreduce/ .  ...  Conversely, Paulson [16] presents call-by-value and call-by-name interpreters for the pure lambda calculus that do handle free variables.  ... 
doi:10.1007/3-540-36377-7_19 fatcat:lvhipzyr2nazjhkungdahil5fe

Demonstrating Lambda Calculus Reduction

Peter Sestoft
2001 Electronical Notes in Theoretical Computer Science  
We describe lambda calculus reduction strategies, such as call-by-value, call-by-name, normal order, and applicative order, using big-step operational semantics.  ...  We show how to simply and efficiently trace such reductions, and use this in a web-based lambda calculus reducer available at http://www.dina.kvl.dk/˜sestoft/lamreduce/ .  ...  Conversely, Paulson [16] presents call-by-value and call-by-name interpreters for the pure lambda calculus that do handle free variables.  ... 
doi:10.1016/s1571-0661(04)80973-3 fatcat:usjdjt53a5cbnkeh4g4n4qeit4

The lambda mechanism in lambda calculus and in other calculi [article]

M. H. van Emden
2015 arXiv   pre-print
A comparison of Landin's form of lambda calculus with Church's shows that, independently of the lambda calculus, there exists a mechanism for converting functions with arguments indexed by variables to  ...  We call this the "lambda mechanism" and show how it can be used in other calculi. In first-order predicate logic it can be used to define new functions and new predicates in terms of existing ones.  ...  This research benefited from facilities provided by the University of Victoria and by the Natural Science and Engineering Research Council of Canada.  ... 
arXiv:1503.00375v4 fatcat:57uj6jchbbbblhwubhu257n3ru

Disjunctive Constraint Lambda Calculi [chapter]

Matthias M. Hölzl, John N. Crossley
2005 Lecture Notes in Computer Science  
We establish a limited form of confluence for the unrestricted calculus and a stronger form for the restricted one.  ...  These calculi are the Unrestricted, and the Restricted, Disjunctive Constraint-Lambda Calculi.  ...  To this end we extend the syntax of the calculus with names for stores, denoted by the letter S (with indices and subscripts if necessary) and with locations.  ... 
doi:10.1007/11591191_6 fatcat:c7jdspgmlbb2ldo4uyzg62mvuu

Parameter-passing and the lambda calculus

Erik Crank, Matthias Felleisen
1991 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '91  
The theory is a strictly smaller theory than Plotkin's call-by-name lambda calculus.  ...  Sci. 1975] showed that the lambda calculus is a good model of the evaluation process for call-by-name functional programs.  ...  Call-by-need and assignment Call-by-need is usually implemented using assignments.  ... 
doi:10.1145/99583.99616 dblp:conf/popl/CrankF91 fatcat:4lybr7fddvhylf3q6e6f6xweia
« Previous Showing results 1 — 15 out of 7,128 results