Full abstraction in the lazy lambda calculus
From MaRDI portal
Publication:1261291
DOI10.1006/inco.1993.1044zbMath0779.03003MaRDI QIDQ1261291
Publication date: 1 September 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1993.1044
Stone duality; filter model; denotational semantics; domain logic; initial solution of domain equation; lazy \(\lambda\)- models; lazy call-by-name \(\lambda\)-calculus
68Q55: Semantics in the theory of computing
68N01: General topics in the theory of software
03B40: Combinatory logic and lambda calculus
Related Items
Call-by-value Solvability, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, A lambda-calculus for dynamic binding, A calculus of mobile processes. I, Infinite \(\lambda\)-calculus and types, Semantical analysis of perpetual strategies in \(\lambda\)-calculus, A co-induction principle for recursively defined domains, A first order logic of effects, Infinitary lambda calculus, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
Uses Software