scientific article; zbMATH DE number 1400716
From MaRDI portal
Publication:4939698
zbMath1159.03311MaRDI QIDQ4939698
Herman Geuvers, Mark-Jan Nederhof
Publication date: 9 February 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items
A higher-order calculus and theory abstraction, Comparing cubes of typed and type assignment systems, Checking algorithms for Pure Type Systems, Closure under alpha-conversion, A short and flexible proof of strong normalization for the calculus of constructions, Modularity of termination and confluence in combinations of rewrite systems with λω, Modular properties of algebraic type systems, On the adequacy of representing higher order intuitionistic logic as a pure type system, A simple model construction for the Calculus of Constructions, Weak normalization implies strong normalization in a class of non-dependent pure type systems, An induction principle for pure type systems
