Approximate Reduction and Lambda Calculus Models

DOI10.1137/0207028zbMath0407.03021MaRDI 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 Theory; Approximate Normal Forms; Approximate Reduction; Models of Lambda Calculus

Mathematics Subject Classification ID

68N01: General topics in the theory of software

03B40: Combinatory logic and lambda calculus

Related Items

On the construction of stable models of untyped \(\lambda\)-calculus, Expressive power of typed and type-free programming languages, 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 \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-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, The interpretation of unsolvable λ-terms in models of untyped λ-calculus