Approximate Reduction and Lambda Calculus Models

DOI10.1137/0207028zbMath0407.03021OpenAlexW2022438838MaRDI QIDQ4193435

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

Programming TheoryApproximate Normal FormsApproximate ReductionModels of Lambda Calculus

Mathematics Subject Classification ID

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

Related Items

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