A nonstandard standardization theorem
From MaRDI portal
Publication:5408457
DOI10.1145/2535838.2535886zbMath1284.68121OpenAlexW2028576530MaRDI QIDQ5408457
Eduardo Bonelli, Delia Kesner, Beniamino Accattoli, Carlos Lombardi
Publication date: 10 April 2014
Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2535838.2535886
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Grammars and rewriting systems (68Q42)
Related Items
The Negligible and Yet Subtle Cost of Pattern Matching, Unification for $$\lambda $$ -calculi Without Propagation Rules, Unnamed Item, A resource aware semantics for a focused intuitionistic calculus, On the value of variables, Projections for infinitary rewriting (extended version), A strong call-by-need calculus, Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic, Node Replication: Theory And Practice, Tight typings and split bounds, fully developed, Unnamed Item, Focused linear logic and the \(\lambda\)-calculus, The spirit of node replication, Projections for infinitary rewriting, On abstract normalisation beyond neededness, Classical By-Need, Unnamed Item, Unnamed Item, The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus, A Fresh Look at the λ-Calculus, (In)efficiency and reasonable cost models
