scientific article; zbMATH DE number 1070568
From MaRDI portal
Publication:4357055
Recommendations
- Characterising explicit substitutions which preserve termination. (Extended abstract)
- Explicit substitutions and higher-order syntax
- Extending the explicit substitution paradigm
- Explicit substitutions and programming languages
- Preserving universal termination through unfold/fold
- Explicit substitutions
- Explicit substitutions and reducibility
- Termination of context sensitive rewriting by rewriting
- Termination of term rewriting by interpretation
- Termination of (canonical) context-sensitive rewriting
Cited in
(15)- Explicit substitution. On the edge of strong normalization
- Revisiting the notion of function
- Comparing and implementing calculi of explicit substitutions with eta-reduction
- Intersection types for explicit substitutions
- On explicit substitution with names
- CINNI -- a generic calculus of explicit substitutions and its application to -, - and -calculi
- The Prismoid of Resources
- Characterising explicit substitutions which preserve termination. (Extended abstract)
- Comparing calculi of explicit substitutions with eta-reduction
- Combinatory reduction systems with explicit substitution that preserve strong normalisation
- Revisiting Zucker's work on the correspondence between cut-elimination and normalisation
- Strong Normalisation of Cut-Elimination That Simulates β-Reduction
- Proof-term synthesis on dependent-type systems via explicit substitutions
- A prismoid framework for languages with resources
- Capture-avoiding substitution as a nominal algebra
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4357055)