Approximate Reduction and Lambda Calculus Models

DOI10.1137/0207028MaRDI QIDQ4193435zbMATH OpenOpenAlexFDO

Authors Christopher P. Wadsworth

Publication date 1978

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0207028

zbMATH Keywords

Approximate Normal FormsApproximate ReductionModels of Lambda CalculusProgramming Theory

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) General topics in the theory of software (68N01)

Cited in

(16)

• Full abstraction and limiting completeness in equational languages
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
• Computing in unpredictable environments: semantics, reduction strategies, and program transformations
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Approximation properties of abstract data types
• Relating graph and term rewriting via Böhm models
• Semantic types and approximation for Featherweight Java
• The interpretation of unsolvable λ-terms in models of untyped λ-calculus
• Relational graph models at work
• Relating graph and term rewriting via Böhm models
• A simplifier for untyped lambda expressions
• On the construction of stable models of untyped -calculus
• Algebraic interpretation of lambda calculus with resources
• How to play the accordion: uniformity and the (non-)conservativity of the linear approximation of the -calculus
• Expressive power of typed and type-free programming languages

This page was built for publication: Approximate Reduction and Lambda Calculus Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4193435)