Michael J. Fischer  Home/Search
Context Related
Links: ACM DBLP | yale.edu/homes/fischer/lambda.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: yale.edu/homes/fischer/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A lambda-calculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols. It is an abstraction of programming languages such as LISP which permit functions to be passed to and returned from other functions. When given an interpretation for its constant and operator symbols, certain schemata, called lambda abstractions, naturally define partial functions over the domain of interpretation. Two implementation strategies are considered: the ... (Update)
Cited by: More
From System F to Typed Assembly Language - Greg Morrisett David (1998) (Correct)
Typed Memory Management via Static Capabilities - David Walker Carnegie (2000) (Correct)
Relational Interpretations of Recursive Types in an.. - Lars Birkedal And (1997) (Correct)
Active bibliography (related documents): More All
1.3: Formal Methods - Selected Historical References - Jones, McCauley (1992) (Correct)
0.6: The Semantics and Implementation of Bindings in Higher-Order.. - Banerjee (1995) (Correct)
0.5: On the Search for Tractable Ways of Reasoning about Programs - Jones (2001) (Correct)
Similar documents based on text: More All
0.1: The Discoveries of Continuations - Reynolds (1993) (Correct)
0.1: Mathematical Expression Recognition: A Survey - Chan, Yeung (1999) (Correct)
0.1: Adaptive Entailment of Equations over Rational Trees - Wolf (1998) (Correct)
Related documents from co-citation: More All
41: Reasoning about programs in continuation-passing style - Sabry, Felleisen
34: Compiling with Continuations (context) - Appel - 1992
34: Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
BibTeX entry: (Update)
Michael J. Fischer. Lambda calculus schemata. In Proceedings of the ACM Conference on Proving Assertions about Programs, pages 104--109. SIGPLAN Notices, Vol. 7, No 1 and SIGACT News, No 14, January 1972. http://citeseer.ist.psu.edu/fischer93lambdacalculus.html More
@inproceedings{ michael72lambdacalculus,
author = "Fischer, Michael J.",
title = "Lambda-Calculus Schemata",
booktitle = "Proceedings {ACM} Conference on Proving Assertions about Programs",
address = "Los Cruces",
pages = "104--109",
year = "1972",
url = "citeseer.ist.psu.edu/fischer93lambdacalculus.html" }
Citations (may not include all citations):218 The mechanical evaluation of expressions (context) - Peter - 1964
185 The Calculi of Lambda-Conversion (context) - Alonzo - 1941
184 Definitional interpreters for higher order programming langu.. (context) - John - 1972
158 Reasoning about programs in continuation-passing style - Amr, Matthias - 1993 ACM DBLP
95 A basis for a mathematical theory of computation - John - 1963 ACM
70 Mathematical Structures in Computer Science (context) - Olivier, Andrzej et al. - 1992
24 second edition (context) - Jr, LISP et al. - 1990
21 Comparative schematology (context) - Michael, Hewitt - 1970 ACM
18 One-way stack automata (context) - Seymour, Sheila et al. - 1967
18 Algol 60 Implementation (context) - Randell, Russell - 1964
15 Computer Science Department (context) - Ashok, the et al. - 1973
13 MACLISP Reference Manual (context) - David - 1974
13 Recursive programming (context) - Edsgar - 1967
12 a Mathematical Semantics for Handling Full Jumps (context) - Christopher, Christopher et al. - 1974
12 Proving algorithms by tail functions (context) - Antoni - 1971 DBLP
9 The Block Concept and Some Possible Implementations (context) - Henhapl, Jones
9 Personal communication (context) - Carl - 1970
8 On formalised computer programs (context) - David, Park et al. - 1970 DBLP
8 Programmers Manual (context) - John, LISP - 1963
7 Block structure: Retention or deletion (context) - Daniel - 1972
6 PAL---a language designed for teaching programming linguisti.. (context) - Arthur - 1968
6 On Ianov's program schemata (context) - Rutledge - 1964 ACM DBLP
6 A bonus from van Wijngaarden's device (context) - Jr - 1972 ACM DBLP
5 Introduction to Oregano (context) - Daniel - 1971
4 Mathematical proofs about computer programs (context) - Cooper - 1967
3 Translating recursion equations into flow charts (context) - Strong - 1971 ACM DBLP
2 Program schemata (context) - Michael - 1968
1 More Comparative Schematology (context) - Carl - 1970
1 Also appears as Artificial intelligence Technical Memo No (context) - Michael, Problems et al. - 1970
1 Pushdown store machines and real-time computation (context) - Steven - 1969 ACM DBLP
1 Program schemas (context) - Zohar - 1973
1 Appears in this issue (context) - John, discoveries et al. - 1993
1 why the FUNARG problem should be called the environment prob.. (context) - Joel, of et al. - 1970
1 75--127 (context) - Iu, schemes et al. - 1960
1 and Felleisen (context) - Daniel - 1988
1 Recursive definition of syntax and semantics (context) - Adriaan - 1966
1 The next 700 programming language descriptions (context) - Morris - 1970
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.yale.edu/homes/fischer/index.html): More
The Consensus Problem in Unreliable Distributed Systems (A Brief.. - Fischer (2000) (Correct)
Lectures on Network Complexity - Fischer (1996) (Correct)
Optimal Layout of Edge-Weighted Forests - Michael Fischer Yale (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC