An algebraic interpretation of the K-calculus; and an application of a labelled -calculus

Cites Work

Title not available (Why is that?)
A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
Approximate Reduction and Lambda Calculus Models
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (35)

Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
Reversibility in the higher-order \(\pi\)-calculus
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
Minimal relative normalization in orthogonal expression reduction systems
On the observational theory of the CPS-calculus
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
Simplified reducibility proofs of Church-Rosser for \({\beta}\)- and \({\beta}{\eta}\)-reduction
Safety of Nöcker's strictness analysis
On the semantics of the call-by-name CPS transform
Title not available (Why is that?)
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
Title not available (Why is that?)
Lambda calculus with algebraic simplification for reduction parallelisation: extended study
Combining algebraic rewriting, extensional lambda calculi, and fixpoints
Algebraic semantics and complexity of term rewriting systems
Highlights in infinitary rewriting and lambda calculus
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
Braids via term rewriting
Approximation properties of abstract data types
Towards bridging time and causal reversibility
From Böhm's theorem to observational equivalences: an informal account
Discrimination by parallel observers: the algorithm.

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)