The Theory of Calculi with Explicit Substitutions Revisited
From MaRDI portal
(Redirected from Publication:3608416)
Recommendations
Cited in
(30)- Intensional computation with higher-order functions
- Normalisation for higher-order calculi with explicit substitutions
- The spirit of node replication
- On explicit substitution with names
- On the Power of Substitution in the Calculus of Structures
- scientific article; zbMATH DE number 6707782 (Why is no real title available?)
- The Prismoid of Resources
- A Theory of Explicit Substitutions with Safe and Full Composition
- The Expansion Problem in Lambda Calculi with Explicit Substitution
- Jumping Boxes
- SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi
- From reduction-based to reduction-free normalization
- scientific article; zbMATH DE number 1956511 (Why is no real title available?)
- scientific article; zbMATH DE number 2080005 (Why is no real title available?)
- scientific article; zbMATH DE number 1500649 (Why is no real title available?)
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
- The Negligible and Yet Subtle Cost of Pattern Matching
- An abstract factorization theorem for explicit substitutions
- New developments in environment machines
- A flexible framework for visualisation of computational properties of general explicit substitutions calculi
- Term Rewriting and Applications
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus
- scientific article; zbMATH DE number 4182831 (Why is no real title available?)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- Node Replication: Theory And Practice
- Canonicity of proofs in constructive modal logic
- A prismoid framework for languages with resources
- Exponentials as substitutions and the cost of cut elimination in linear logic
- Coherence by normalization for linear multicategorical structures
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
This page was built for publication: The Theory of Calculi with Explicit Substitutions Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608416)
