Term Rewriting and Applications
From MaRDI portal
Publication:5703848
DOI10.1007/b135673zbMath1078.68020MaRDI QIDQ5703848
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b135673
68N18: Functional programming and lambda calculus
68Q42: Grammars and rewriting systems
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
03B40: Combinatory logic and lambda calculus
Related Items
GENERALITY AND EXISTENCE 1: QUANTIFICATION AND FREE LOGIC, Normalization in the simply typed -calculus, Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage, Classical natural deduction for S4 modal logic, Investigations on the dual calculus, Dualized Simple Type Theory, Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less), Call-by-Value Is Dual to Call-by-Name, Extended, Dual Calculus with Inductive and Coinductive Types