Interaction systems II: The practice of optimal reductions
From MaRDI portal
Recommendations
- Interaction Systems I: The theory of optimal reductions
- Optimal reductions in interaction systems
- Combinatory reduction systems: Introduction and survey
- Systems of reductions
- The logic of interactive turing reduction
- On the correspondence between two classes of reduction systems
- Weak reduction and garbage collection in interaction nets
- Interaction nets and term-rewriting systems
Cites work
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 130889 (Why is no real title available?)
- scientific article; zbMATH DE number 3556029 (Why is no real title available?)
- scientific article; zbMATH DE number 517043 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- scientific article; zbMATH DE number 3088180 (Why is no real title available?)
- Interaction Systems I: The theory of optimal reductions
- Optimal reductions in interaction systems
- Paths, computations and labels in the λ-calculus
Cited in
(11)- Proof nets, garbage, and computations
- scientific article; zbMATH DE number 50753 (Why is no real title available?)
- Optimal reductions in interaction systems
- The optimal implementation of functional programming languages
- Coherence for sharing proof nets
- scientific article; zbMATH DE number 1479624 (Why is no real title available?)
- Developing developments
- Token-passing optimal reduction with embedded read-back
- Coherence for sharing proof-nets
- δο!∈=1 Optimizing optimal λ-calculus implementations
- scientific article; zbMATH DE number 742718 (Why is no real title available?)
This page was built for publication: Interaction systems II: The practice of optimal reductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350498)