A Rewriting View of Simple Typing

DOI10.2168/LMCS-9(1:4)2013zbMath1272.03142arXiv1211.0865OpenAlexW3102394861MaRDI QIDQ4913767

Ruba El Haj Omar, Aaron Stump, Garrin Kimmell, Hans Zantema

Publication date: 9 April 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.0865

zbMATH Keywords

confluenceterm rewritingsimple type theorysimply typed lambda-calculustype safetyterm-rewriting

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items

Finding small counterexamples for abstract rewriting properties ⋮ First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification ⋮ Labelings for decreasing diagrams

Uses Software

• Automath