Pages that link to "Item:Q1229201"

The following pages link to An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus (Q1229201):

Displaying 35 items.

• Reversibility in the higher-order \(\pi\)-calculus (Q264996) (← links)
• On the observational theory of the CPS-calculus (Q968276) (← links)
• A characterization of F-complete type assignments (Q1089331) (← links)
• Sequential algorithms on concrete data structures (Q1170880) (← links)
• Combining algebraic rewriting, extensional lambda calculi, and fixpoints (Q1349901) (← links)
• Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) (← links)
• A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. (Q1401936) (← links)
• On the semantics of the call-by-name CPS transform (Q1575687) (← links)
• Approximation properties of abstract data types (Q1838281) (← links)
• Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
• Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) (← links)
• Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
• A parametric framework for reversible \(\pi\)-calculi (Q2216133) (← links)
• Reversibility in session-based concurrency: a fresh look (Q2360649) (← links)
• Braids via term rewriting (Q2422032) (← links)
• The conflict-free reduction geometry (Q2581368) (← links)
• (Q3384917) (← links)
• Safety of Nöcker's strictness analysis (Q3520168) (← links)
• Syntactic Metatheory of Higher-Order Subtyping (Q3540196) (← links)
• (Q3674617) (← links)
• Meeting of the Association for Symbolic Logic Florence, Italy 1982 (Q3686697) (← links)
• Simulating expansions without expansions (Q4322432) (← links)
• A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object (Q4630299) (← links)
• Combining first order algebraic rewriting systems, recursion and extensional lambda calculi (Q4632448) (← links)
• From Böhm's Theorem to Observational Equivalences (Q4916172) (← links)
• (Q4957789) (← links)
• Lambda calculus with algebraic simplification for reduction parallelisation: Extended study (Q5016210) (← links)
• Towards Bridging Time and Causal Reversibility (Q5041271) (← links)
• Algebraic semantics and complexity of term rewriting systems (Q5055729) (← links)
• Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction (Q5178963) (← links)
• The infinitary lambda calculus of the infinite eta Böhm trees (Q5269002) (← links)
• Intersection types for \(\lambda\)-trees (Q5958291) (← links)
• Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach (Q6135754) (← links)
• Causal reversibility for timed process calculi with lazy/eager durationless actions and time additivity (Q6536425) (← links)
• Minimal relative normalization in orthogonal expression reduction systems (Q6567775) (← links)