The Theory of Calculi with Explicit Substitutions Revisited
From MaRDI portal
Publication:3608416
DOI10.1007/978-3-540-74915-8_20zbMATH Open1179.03022OpenAlexW1529760921MaRDI QIDQ3608416FDOQ3608416
Authors: Delia Kesner 
Publication date: 5 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.545.1343
Recommendations
Cited In (28)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- A flexible framework for visualisation of computational properties of general explicit substitutions calculi
- The Expansion Problem in Lambda Calculi with Explicit Substitution
- Intensional computation with higher-order functions
- Title not available (Why is that?)
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus
- The Negligible and Yet Subtle Cost of Pattern Matching
- The spirit of node replication
- The Prismoid of Resources
- Term Rewriting and Applications
- New developments in environment machines
- On the Power of Substitution in the Calculus of Structures
- Jumping Boxes
- Normalisation for higher-order calculi with explicit substitutions
- A Theory of Explicit Substitutions with Safe and Full Composition
- Node Replication: Theory And Practice
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- On explicit substitution with names
- Title not available (Why is that?)
- Exponentials as substitutions and the cost of cut elimination in linear logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- From reduction-based to reduction-free normalization
- An abstract factorization theorem for explicit substitutions
- A prismoid framework for languages with resources
- SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi
- Canonicity of proofs in constructive modal logic
Uses Software
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)
