Category:LNCS 1074

From BibNetWiki

Lecture Notes in Computer Science, Volume 1074

Articles in category "LNCS 1074"

There are 16 articles in this category.

A A Complete Proof System for Nested Term Graphs Abstraction of Hardware Construction Approximation and Normalization Results for Typeable Term Rewriting Systems Assertions and Recursions C Collapsing Partial Combinatory Algebras

D Development Closed Critical Pairs H Higher-Order Algebra with Transfinite Types Higher-Order Equational Logic for Specification, Simulation and Testing Higher-order algebra, logic, and term rewriting: second international workshop, HOA '95, Paderborn, Germany, September 21-22, 1995: selected papers M Modular Properties of Algebraic Type Systems R R0n- and G0n-Logics

T Term Graph Rewriting The Correctness of a Higher-Order Lazy Functional Language Implementation: An Exercise in Mechanical Theorem Proving The Variable Containment Problem Third-Order Matching in the Polymorphic Lambda Calculus Two Different Strong Normalization Proofs?