An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
From MaRDI portal
Publication:1229201
DOI10.1016/0304-3975(76)90009-8zbMath0335.02016OpenAlexW1999005577MaRDI QIDQ1229201
Publication date: 1976
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(76)90009-8
Related Items
Reversibility in the higher-order \(\pi\)-calculus, Infinitary lambda calculus and discrimination of Berarducci trees., Reversibility in session-based concurrency: a fresh look, Towards Bridging Time and Causal Reversibility, A characterization of F-complete type assignments, Algebraic semantics and complexity of term rewriting systems, Combining algebraic rewriting, extensional lambda calculi, and fixpoints, Unnamed Item, Highlights in infinitary rewriting and lambda calculus, Computing in unpredictable environments: semantics, reduction strategies, and program transformations, Braids via term rewriting, Simulating expansions without expansions, A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names., Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach, Safety of Nöcker's strictness analysis, Unnamed Item, A parametric framework for reversible \(\pi\)-calculi, Sequential algorithms on concrete data structures, Syntactic Metatheory of Higher-Order Subtyping, A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object, Combining first order algebraic rewriting systems, recursion and extensional lambda calculi, Unnamed Item, From Böhm's Theorem to Observational Equivalences, On the observational theory of the CPS-calculus, Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction, Intersection types for \(\lambda\)-trees, On the semantics of the call-by-name CPS transform, Approximation properties of abstract data types, Discrimination by parallel observers: the algorithm., The conflict-free reduction geometry, Lambda calculus with algebraic simplification for reduction parallelisation: Extended study, Meeting of the Association for Symbolic Logic Florence, Italy 1982, The infinitary lambda calculus of the infinite eta Böhm trees
Cites Work
