The lambda calculus. Its syntax and semantics. Rev. ed.
From MaRDI portal
Publication:801050
zbMATH Open0551.03007MaRDI QIDQ801050FDOQ801050
Authors: Henk Barendregt 
Publication date: 1984
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
Recommendations
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01)
Cited In (only showing first 100 items - show all)
- The theory of contexts for first order and higher order abstract syntax
- Collapsing partial combinatory algebras
- Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction
- Taming the Merge Operator
- A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\)
- On the observational theory of the CPS-calculus
- Functional semantics
- Algebra of constructions. I. The word problem for partial algebras
- Compositional characterisations of \(\lambda\)-terms using intersection types
- Weak linearization of the lambda calculus
- Strong normalization in type systems: A model theoretical approach
- Operational semantics for declarative multi-paradigm languages
- The variable containment problem
- On the confluence of lambda-calculus with conditional rewriting
- Intersection typed \(\lambda \)-calculus
- On modular properties of higher order extensional lambda calculi
- The self-reduction in lambda calculus
- Confluence of the lambda calculus with left-linear algebraic rewriting
- A proof theoretical approach to communication
- From exact sciences to life phenomena: Following Schrödinger and Turing on programs, life and causality
- Observational program calculi and the correctness of translations
- On the power of simple diagrams
- On structural properties of eta-expansions of identity
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters
- Reflexive objects in topological categories
- Applications of infinitary lambda calculus
- On the completeness of order-theoretic models of the \(\lambda \)-calculus
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- A construction of one-point bases in extended lambda calculi
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- A meta-language for typed object-oriented languages
- Non-existent Statman's double fixed point combinator does not exist, indeed
- The geometry of orthogonal reduction spaces
- The systematic construction of a one-combinator basis for lambda-terms
- A synthetic axiomatization of map theory
- Intersection and union types
- Title not available (Why is that?)
- Pattern matching as cut elimination
- A first-order one-pass CPS transformation
- Intersection types for explicit substitutions
- On explicit substitution with names
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints
- Towards lambda calculus order-incompleteness
- Order-incompleteness and finite lambda reduction models
- A logic of abstraction related to finite constructive number classes
- A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG
- A termination ordering for higher order rewrite systems
- Highlights in infinitary rewriting and lambda calculus
- Some results on extensionality in lambda calculus
- Inter-deriving Semantic Artifacts for Object-Oriented Programming
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory
- The logic of message-passing
- The \(\lambda \)-calculus in the \(\pi \)-calculus
- Intersection types and lambda models
- An irregular filter model
- Complete laziness: a natural semantics
- The differential method and the causal incompleteness of programming theory in molecular biology
- Semantical analysis of perpetual strategies in \(\lambda\)-calculus
- Behavioural inverse limit \(\lambda\)-models
- Intersection types and domain operators
- Normal-order reduction grammars
- Generalized filter models
- A Realizability Interpretation for Intersection and Union Types
- From Böhm's theorem to observational equivalences: an informal account
- Discrimination by parallel observers: the algorithm.
- Execution time of λ-terms via denotational semantics and intersection types
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- Title not available (Why is that?)
- A calculus of coroutines
- Reversibility in the higher-order \(\pi\)-calculus
- The heart of intersection type assignment: Normalisation proofs revisited
- Alpha equivalence equalities
- A note on harmony
- A relational semantics for parallelism and non-determinism in a functional setting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Principal type scheme and unification for intersection type discipline
- Complete restrictions of the intersection type discipline
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization
- Essential and relational models
- An algebraic generalization of Frege structures -- binding algebras
- Intersection type assignment systems
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- CPS-translation as adjoint
- Towards a notion of lambda monoid
- Relational graph models, Taylor expansion and extensionality
- Equivalence of bar recursors in the theory of functionals of finite type
- Classical lambda calculus in modern dress
- Efficient self-interpretation in lambda calculus
- Computational interpretations of linear logic
- Approximation semantics and expressive predicate assignment for object-oriented programming (extended abstract)
- Domain theory in logical form
- Graph easy sets of mute lambda terms
- Normalization, approximation, and semantics for combinator systems
- Higher-order rewrite systems and their confluence
- Game-theoretic analysis of call-by-value computation
- Strong normalization property for second order linear logic
- Intersection types for \(\lambda\)-trees
- Perpetual reductions in \(\lambda\)-calculus
- Typability and type checking in System F are equivalent and undecidable
This page was built for publication: The lambda calculus. Its syntax and semantics. Rev. ed.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801050)
