Skip header Section
Skip Bibliometrics Section
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)January 1985
- Author:
- Alonzo Church
Abstract
No abstract available.
Cited By
Guidi F (2021). A Formal System for the Universal Quantification of Schematic Variables, ACM Transactions on Computational Logic, 23:1, (1-37), Online publication date: 31-Jan-2022.- Hehner E (2020). Epimenides, Gödel, Turing: An Eternal Gölden Twist, SN Computer Science, 1:6, Online publication date: 1-Nov-2020.
- Chen X and Roşu G —A Semantic Framework for Programming Languages and Formal Analysis Engineering Trustworthy Software Systems, (122-158)
- Pieters R and Schrijvers T Faster Coroutine Pipelines: A Reconstruction Practical Aspects of Declarative Languages, (133-149)
- Stump A (2016). Verified Functional Programming in Agda, 10.1145/2841316, Online publication date: 1-Feb-2016.
- Kutepov V and Shamal' P (2014). Implementation of functional parallel typified language (FPTL) on multicore computers, Journal of Computer and Systems Sciences International, 53:3, (345-358), Online publication date: 1-May-2014.
- Grust T, Schweinsberg N and Ulrich A (2013). Functions are data too, Proceedings of the VLDB Endowment, 6:12, (1214-1217), Online publication date: 28-Aug-2013.
- Langmaack H and Salwicki A (2013). Some Methodological Remarks Inspired by the Paper “On inner classes” by A. Igarashi and B. Pierce, Fundamenta Informaticae, 122:3, (227-274), Online publication date: 1-Jul-2013.
- Shivers O and Wand M (2010). Bottom-up β-reduction: Uplinks and λ-DAGs, Fundamenta Informaticae, 103:1-4, (247-287), Online publication date: 1-Jan-2010.
- Cook W On understanding data abstraction, revisited Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications, (557-572)
- Cook W (2009). On understanding data abstraction, revisited, ACM SIGPLAN Notices, 44:10, (557-572), Online publication date: 25-Oct-2009.
- Guidi F (2009). The formal system λδ, ACM Transactions on Computational Logic, 11:1, (1-37), Online publication date: 1-Oct-2009.
- Arbiser A, Miquel A and RÍos A (2009). The λ-calculus with constructors, Journal of Functional Programming, 19:5, (581-631), Online publication date: 1-Sep-2009.
- Danvy O From reduction-based to reduction-free normalization Proceedings of the 6th international conference on Advanced functional programming, (66-164)
- Xing C (2008). Enhancing the learning and teaching of functions through programming in ML, Journal of Computing Sciences in Colleges, 23:4, (97-104), Online publication date: 1-Apr-2008.
- Kikuchi K and Lengrand S Strong normalisation of cut-elimination that simulates β-reduction Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures, (380-394)
- Biernacka M and Danvy O (2007). A concrete framework for environment machines, ACM Transactions on Computational Logic, 9:1, (6-es), Online publication date: 1-Dec-2007.
- Eberbach E (2007). The $-calculus process algebra for problem solving, Theoretical Computer Science, 383:2-3, (200-243), Online publication date: 3-Sep-2007.
- Turner R (2007). Understanding Programming Languages, Minds and Machines, 17:2, (203-216), Online publication date: 1-Jul-2007.
- Grue K The Layers of Logiweb Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference, (250-264)
- Hudak P, Hughes J, Peyton Jones S and Wadler P A history of Haskell Proceedings of the third ACM SIGPLAN conference on History of programming languages, (12-1-12-55)
- Biernacka M and Danvy O (2007). A syntactic correspondence between context-sensitive calculi and abstract machines, Theoretical Computer Science, 375:1-3, (76-108), Online publication date: 20-Apr-2007.
- Kesner D and Lengrand S (2007). Resource operators for λ-calculus, Information and Computation, 205:4, (419-473), Online publication date: 1-Apr-2007.
- Backus J Can programming be liberated from the von Neumann style? ACM Turing award lectures
- Wolff J (2006). Medical diagnosis as pattern recognition in a framework of information compression by multiple alignment, unification and search, Decision Support Systems, 42:2, (608-625), Online publication date: 1-Nov-2006.
- Luqi L, Berzins V and Musial P Reliability properties of models for flexible design and run-time analysis Proceedings of the 13th Monterey conference on Composition of embedded systems: scientific and industrial issues, (207-219)
- Luqi , Berzins V and Musial P Reliability Properties of Models for Flexible Design and Run-Time Analysis Composition of Embedded Systems. Scientific and Industrial Issues, (207-219)
- Salzberg C (2006). From Machine and Tape to Structure and Function: Formulation of a Reflexively Computing System, Artificial Life, 12:4, (487-512), Online publication date: 1-Oct-2006.
- Donnelly K and Xi H Combining higher-order abstract syntax with first-order abstract syntax in ATS Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding, (58-63)
- Kesner D and Lengrand S Extending the explicit substitution paradigm Proceedings of the 16th international conference on Term Rewriting and Applications, (407-422)
- Shivers O and Wand M Bottom-up β-reduction Proceedings of the 14th European conference on Programming Languages and Systems, (217-232)
- Fischer M and Merritt M (2003). Appraising two decades of distributed computing theory research, Distributed Computing, 16:2-3, (239-247), Online publication date: 1-Sep-2003.
- Apostoli P and Kanda A Upper and lower recursion schemes in abstract approximation spaces Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing, (205-212)
- Allison L Types and classes of machine learning and data mining Proceedings of the 26th Australasian computer science conference - Volume 16, (207-215)
- Noga M, Schott S and Löwe W Lazy XML processing Proceedings of the 2002 ACM symposium on Document engineering, (88-94)
- Neergaard P and Sørensen M (2002). Conservation and uniform normalization in Lambda calculi with erasing reductions, Information and Computation, 178:1, (149-179), Online publication date: 10-Oct-2002.
- Dufourd J and Luther S Parametrizing geometric objects using λ-calculus Proceedings of the 18th Spring Conference on Computer Graphics, (185-194)
- Case J, Jain S and Suraj M (2002). Control structures in hypothesis spaces, Theoretical Computer Science, 270:1-2, (287-308), Online publication date: 6-Jan-2002.
- Danvy O, Grobauer B and Rhiger M A unifying approach to goal-directed evaluation Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation, (108-125)
- Khasidashvili Z (2001). On the longest perpetual reductions in orthogonal expression reduction systems, Theoretical Computer Science, 266:1-2, (737-772), Online publication date: 6-Sep-2001.
- Danvy O and Nielsen L Defunctionalization at work Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, (162-174)
- Lee E and Parks T Dataflow process networks Readings in hardware/software co-design, (59-85)
- Kamareddine F and Laan T (2001). A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems, Journal of Logic, Language and Information, 10:3, (375-402), Online publication date: 1-Jun-2001.
- Statman R Church's lambda delta calculus Proceedings of the 7th international conference on Logic for programming and automated reasoning, (293-307)
- Penrose R (2000). Reminiscences of Christopher Strachey, Higher-Order and Symbolic Computation, 13:1-2, (83-84), Online publication date: 1-Apr-2000.
- Noro M and Ajisaka T Manipulating Software Semantics with Unified Computational Model and Software Quark Model Proceedings of the Sixth Asia Pacific Software Engineering Conference
- Wand M (1999). Continuation-Based Multiprocessing Revisited, Higher-Order and Symbolic Computation, 12:3, (283-283), Online publication date: 1-Oct-1999.
- Blume M and Appel A (1999). Hierarchical modularity, ACM Transactions on Programming Languages and Systems, 21:4, (813-847), Online publication date: 1-Jul-1999.
- Sussman G and Steele G (1998). Scheme, Higher-Order and Symbolic Computation, 11:4, (405-439), Online publication date: 1-Dec-1998.
- Reynolds J (1998). Definitional Interpreters for Higher-Order Programming Languages, Higher-Order and Symbolic Computation, 11:4, (363-397), Online publication date: 1-Dec-1998.
- Lawall J and Mairson H (1997). On global dynamics of optimal graph reduction, ACM SIGPLAN Notices, 32:8, (188-195), Online publication date: 1-Aug-1997.
- Lawall J and Mairson H On global dynamics of optimal graph reduction Proceedings of the second ACM SIGPLAN international conference on Functional programming, (188-195)
- Hillebrand G and Kanellakis P On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
- Pippenger N Pure versus impure Lisp Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (104-109)
- Steele G and Gabriel R The evolution of Lisp History of programming languages---II, (233-330)
- Baker H (1994). Linear logic and permutation stacks—the Forth shall be first, ACM SIGARCH Computer Architecture News, 22:1, (34-43), Online publication date: 1-Mar-1994.
- Holmes D and Howland J (1993). APROL, ACM SIGAPL APL Quote Quad, 24:1, (112-123), Online publication date: 1-Sep-1993.
- Holmes D and Howland J APROL Proceedings of the international conference on APL, (112-123)
- Milner R (1993). Elements of interaction, Communications of the ACM, 36:1, (78-89), Online publication date: 1-Jan-1993.
- Rozas G Taming the Y operator Proceedings of the 1992 ACM conference on LISP and functional programming, (226-234)
- Rozas G (1992). Taming the Y operator, ACM SIGPLAN Lisp Pointers, V:1, (226-234), Online publication date: 1-Jan-1992.
- Cherlin E (1991). Pure functions in APL and J, ACM SIGAPL APL Quote Quad, 21:4, (88-93), Online publication date: 1-Jul-1991.
- Cherlin E Pure functions in APL and J Proceedings of the international conference on APL '91, (88-93)
- Yang J and Choo Y (1991). Parallel-program transformation using a metalanguage, ACM SIGPLAN Notices, 26:7, (11-20), Online publication date: 1-Jul-1991.
- Yang J and Choo Y Parallel-program transformation using a metalanguage Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming, (11-20)
- Crank E and Felleisen M Parameter-passing and the lambda calculus Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (233-244)
- Collavizza H Functional semantics of microprocessors at the microprogram level and correspondence with the machine instruction level Proceedings of the conference on European design automation, (52-56)
- Field J On laziness and optimality in lambda interpreters: tools for specification and analysis Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (1-15)
- Chao S and Bryant B Denotational data flow analysis for parallel implementation of imperative programs Proceedings of the 1988 ACM sixteenth annual conference on Computer science, (17-26)
- Pfenning F Partial polymorphic type inference and higher-order unification Proceedings of the 1988 ACM conference on LISP and functional programming, (153-163)
- Vuillemin J Exact real computer arithmetic with continued fractions Proceedings of the 1988 ACM conference on LISP and functional programming, (14-27)
- Sosnowski R (1987). Prolog dialects: a deja vu of BASICs, ACM SIGPLAN Notices, 22:6, (39-48), Online publication date: 1-Jun-1987.
- Clemmensen G and Oest O Formal specification and development of an ada compiler - a vdm case study Proceedings of the 7th international conference on Software engineering, (430-440)
- Hoffmann C and O`Donnell M Implementation of an interpreter for abstract equations Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (111-121)
- Schmittgen C and Kluge W (1983). A system architecture for the concurrent evaluation of applicative program expressions, ACM SIGARCH Computer Architecture News, 11:3, (356-362), Online publication date: 30-Jun-1983.
- Schmittgen C and Kluge W A system architecture for the concurrent evaluation of applicative program expressions Proceedings of the 10th annual international symposium on Computer architecture, (356-362)
- Clifford J and Warren D (1983). Formal semantics for time in databases, ACM Transactions on Database Systems, 8:2, (214-254), Online publication date: 1-Jun-1983.
- Pratt V Five paradigm shifts in programming language design and their realization in Viron, a dataflow programming environment Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (1-9)
- Main M and Benson D (1983). Denotational semantics for "natural" language question-answering programs, Computational Linguistics, 9:1, (11-21), Online publication date: 1-Jan-1983.
- Jones S An investigation of the relative efficiencies of combinators and lambda expressions Proceedings of the 1982 ACM symposium on LISP and functional programming, (150-158)
- Reynolds C Computer animation with scripts and actors Proceedings of the 9th annual conference on Computer graphics and interactive techniques, (289-296)
- Reynolds C (1982). Computer animation with scripts and actors, ACM SIGGRAPH Computer Graphics, 16:3, (289-296), Online publication date: 1-Jul-1982.
- Brooks R, Gabriel R and Steele G An optimizing compiler for lexically scoped LISP Proceedings of the 1982 SIGPLAN symposium on Compiler construction, (261-275)
- Brooks R, Gabriel R and Steele G (1982). An optimizing compiler for lexically scoped LISP, ACM SIGPLAN Notices, 17:6, (261-275), Online publication date: 1-Jun-1982.
- Backus J Function level programs as mathematical objects Proceedings of the 1981 conference on Functional programming languages and computer architecture, (1-10)
- Wand M Continuation-based multiprocessing Proceedings of the 1980 ACM conference on LISP and functional programming, (19-28)
- Boley H (1980). A preliminary survey of artificial intelligence machines, ACM SIGART Bulletin:72, (21-28), Online publication date: 1-Jul-1980.
- Morris J, Schmidt E and Wadler P Experience with an applicative string processing language Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (32-46)
- Martin J FAD, a functional programming language that supports abstract data types Proceedings of the ACM 1980 annual conference, (247-262)
- Stoyan H (1979). LISP history, ACM Lisp Bulletin:3, (42-53), Online publication date: 1-Dec-1979.
- Steele G and Sussman G (1979). Constraints, ACM SIGAPL APL Quote Quad, 9:4-P1, (208-225), Online publication date: 1-Jun-1979.
- More T (1979). The nested rectangular array as a model of data, ACM SIGAPL APL Quote Quad, 9:4-P1, (55-73), Online publication date: 1-Jun-1979.
- Steele G and Sussman G Constraints Proceedings of the international conference on APL: part 1, (208-225)
- More T The nested rectangular array as a model of data Proceedings of the international conference on APL: part 1, (55-73)
- Backus J (1978). Can programming be liberated from the von Neumann style?, Communications of the ACM, 21:8, (613-641), Online publication date: 1-Aug-1978.
- Webber B Description formation and discourse model synthesis Proceedings of the 1978 workshop on Theoretical issues in natural language processing, (42-50)
- Berkling K Computer architecture for correct programming Proceedings of the 5th annual symposium on Computer architecture, (78-84)
- Allen J (1978). Anatomy of LISP, 10.5555/542865, Online publication date: 1-Jan-1978.
- O'Donnell M Subtree replacement systems Proceedings of the ninth annual ACM symposium on Theory of computing, (295-305)
- Steele G Debunking the “expensive procedure call” myth or, procedure call implementations considered harmful or, LAMBDA Proceedings of the 1977 annual conference, (153-162)
- Berry G and Lévy J Minimal and optimal computations of recursive programs Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (215-226)
- Tennent R (1976). The denotational semantics of programming languages, Communications of the ACM, 19:8, (437-453), Online publication date: 1-Aug-1976.
- Donovan J, Gutentag L, Madnick S and Smith G An application of a generalized management information system to energy policy and decision making Proceedings of the May 19-22, 1975, national computer conference and exposition, (681-686)
- Berkling K Reduction languages for reduction machines Proceedings of the 2nd annual symposium on Computer architecture, (133-140)
- Berkling K (1974). Reduction languages for reduction machines, ACM SIGARCH Computer Architecture News, 3:4, (133-140), Online publication date: 1-Dec-1974.
- Bouricius W Procedure for testing microprograms Conference record of the 7th annual workshop on Microprogramming, (235-240)
- Backus J Programming language semantics and closed applicative languages Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (71-86)
- MacLennan B (1973). Fen—an axiomatic basis for program semantics, Communications of the ACM, 16:8, (468-474), Online publication date: 1-Aug-1973.
- Leavenworth B (1972). Programming with(out) the GOTO, ACM SIGPLAN Notices, 7:11, (54-58), Online publication date: 1-Nov-1972.
- Ledgard H (1972). A model for type checking, Communications of the ACM, 15:11, (956-966), Online publication date: 1-Nov-1972.
- Leavenworth B Programming with(out) the GOTO Proceedings of the ACM annual conference - Volume 2, (782-786)
- Reynolds J Definitional interpreters for higher-order programming languages Proceedings of the ACM annual conference - Volume 2, (717-740)
- Pietrzykowski T and Jensen D A complete mechanization of (Ω) -order type theory Proceedings of the ACM annual conference - Volume 1, (82-92)
- McGowan C The “most recent” error Proceedings of ACM conference on Proving assertions about programs, (191-202)
- Wegner P Operational semantics of programming languages Proceedings of ACM conference on Proving assertions about programs, (128-141)
- McGowan C The Contour Model Lambda Calculus Machine Proceedings of ACM conference on Proving assertions about programs, (110-115)
- Fischer M Lambda calculus schemata Proceedings of ACM conference on Proving assertions about programs, (104-109)
- McGowan C (1972). The “most recent” error, ACM SIGACT News:14, (191-202), Online publication date: 1-Jan-1972.
- Wegner P (1972). Operational semantics of programming languages, ACM SIGACT News:14, (128-141), Online publication date: 1-Jan-1972.
- McGowan C (1972). The Contour Model Lambda Calculus Machine, ACM SIGACT News:14, (110-115), Online publication date: 1-Jan-1972.
- Fischer M (1972). Lambda calculus schemata, ACM SIGACT News:14, (104-109), Online publication date: 1-Jan-1972.
- McGowan C (1972). The “most recent” error, ACM SIGPLAN Notices, 7:1, (191-202), Online publication date: 1-Jan-1972.
- Wegner P (1972). Operational semantics of programming languages, ACM SIGPLAN Notices, 7:1, (128-141), Online publication date: 1-Jan-1972.
- McGowan C (1972). The Contour Model Lambda Calculus Machine, ACM SIGPLAN Notices, 7:1, (110-115), Online publication date: 1-Jan-1972.
- Fischer M (1972). Lambda calculus schemata, ACM SIGPLAN Notices, 7:1, (104-109), Online publication date: 1-Jan-1972.
- Reinfelds J (1971). A concept by concept description of the AMTRAN language, ACM SIGPLAN Notices, 6:11, (32-59), Online publication date: 1-Nov-1971.
- Fraser A (1971). On the meaning of names in programming systems, Communications of the ACM, 14:6, (409-416), Online publication date: 1-Jun-1971.
- Berry D Block structure (Extended Abstract) Proceedings of the third annual ACM symposium on Theory of computing, (86-100)
- McGowan C and Wegner P (1971). The equivalence of sequential and associate information structure models, ACM SIGPLAN Notices, 6:2, (191-216), Online publication date: 1-Feb-1971.
- Jenks R (1970). META/LISP, ACM SIGSAM Bulletin:16, (10-18), Online publication date: 1-Oct-1970.
- McGowan C The correctness of a modified SECD machine Proceedings of the second annual ACM symposium on Theory of computing, (149-157)
- Basu S (1968). On Reduction of Program Schemes, SIAM Journal on Applied Mathematics, 16:2, (328-339), Online publication date: 1-Mar-1968.
- Feldman J and Gries D (1968). Translator writing systems, Communications of the ACM, 11:2, (77-113), Online publication date: 1-Feb-1968.
- Evans A PAL—a language designed for teaching programming linguistics Proceedings of the 1968 23rd ACM national conference, (395-403)
- Burge W (1966). A reprogramming machine, Communications of the ACM, 9:2, (60-66), Online publication date: 1-Feb-1966.
- Wirth N and Weber H (1966). EULER: A generalization of ALGOL and its formal definition: Part 1, Communications of the ACM, 9:1, (13-25), Online publication date: 1-Jan-1966.
- Burge W The evaluation, classification and interpretation of expressions Proceedings of the 1964 19th ACM national conference, (11.401-11.4022)
- McCarthy J A basis for a mathematical theory of computation, preliminary report Papers presented at the May 9-11, 1961, western joint IRE-AIEE-ACM computer conference, (225-238)
Index Terms
- The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Recommendations
Infinitary Lambda Calculi from a Linear Perspective
LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer ScienceWe introduce a linear infinitary λ-calculus, called ℓΛ∞, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted coinductively. The obtained calculus embeds the ...
Natural Deduction Calculi and Sequent Calculi for Counterfactual Logics
In this paper we present labelled sequent calculi and labelled natural deduction calculi for the counterfactual logics CK + {ID, MP}. As for the sequent calculi we prove, in a semantic manner, that the cut-rule is admissible. As for the natural ...
Pure Sequent Calculi: Analyticity and Decision Procedure
Analyticity, also known as the subformula property, typically guarantees decidability of derivability in propositional sequent calculi. To utilize this fact, two substantial gaps have to be addressed: (i) What makes a sequent calculus analytic? and (ii) ...