An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
From MaRDI portal
(Redirected from Publication:1229201)
An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
Cites work
- scientific article; zbMATH DE number 3495581 (Why is no real title available?)
- scientific article; zbMATH DE number 3503200 (Why is no real title available?)
- scientific article; zbMATH DE number 3513288 (Why is no real title available?)
- scientific article; zbMATH DE number 3439971 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- Approximate Reduction and Lambda Calculus Models
Cited in
(35)- Discrimination by parallel observers: the algorithm.
- Towards bridging time and causal reversibility
- From Böhm's theorem to observational equivalences: an informal account
- Reversibility in the higher-order \(\pi\)-calculus
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations
- Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
- On the observational theory of the CPS-calculus
- Minimal relative normalization in orthogonal expression reduction systems
- The conflict-free reduction geometry
- Hereditary substitution for the \(\lambda \Delta \)-calculus
- Sequential algorithms on concrete data structures
- A confluent reduction for the extensional typed \(\lambda\)-calculus with pairs, sums, recursion and terminal object
- The infinitary lambda calculus of the infinite eta Böhm trees
- Intersection types for \(\lambda\)-trees
- A characterization of F-complete type assignments
- Reversibility in session-based concurrency: a fresh look
- Meeting of the Association for Symbolic Logic Florence, Italy 1982
- A parametric framework for reversible \(\pi\)-calculi
- On the semantics of the call-by-name CPS transform
- Safety of Nöcker's strictness analysis
- Simplified reducibility proofs of Church-Rosser for \({\beta}\)- and \({\beta}{\eta}\)-reduction
- scientific article; zbMATH DE number 3827824 (Why is no real title available?)
- A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names.
- Infinitary lambda calculus and discrimination of Berarducci trees.
- Syntactic Metatheory of Higher-Order Subtyping
- scientific article; zbMATH DE number 7447776 (Why is no real title available?)
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints
- Lambda calculus with algebraic simplification for reduction parallelisation: extended study
- Highlights in infinitary rewriting and lambda calculus
- Algebraic semantics and complexity of term rewriting systems
- Simulating expansions without expansions
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- Causal reversibility for timed process calculi with lazy/eager durationless actions and time additivity
- Approximation properties of abstract data types
- Braids via term rewriting
This page was built for publication: An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229201)
