scientific article
From MaRDI portal
zbMath1063.03522MaRDI QIDQ3024846
Publication date: 4 July 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Strongly-Normalizing Higher-Order Relational Queries, Pattern matching as cut elimination, Intersection types for explicit substitutions, Explicit substitutions with de bruijn's levels, Problems in rewriting III, Combinatory reduction systems with explicit substitution that preserve strong normalisation, Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract), Unification for $$\lambda $$ -calculi Without Propagation Rules, On explicit substitution with names, On explicit substitutions and names (extended abstract), Resource operators for \(\lambda\)-calculus, Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic, Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting, Unnamed Item, A prismoid framework for languages with resources, The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations, A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi, Subtractive logic, Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus, Lambda-calculus with director strings, The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus, Explicit substitution. On the edge of strong normalization, Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
