scientific article
From MaRDI portal
Publication:3889024
zbMath0445.03005MaRDI QIDQ3889024
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Quantum computation with programmable connections between gates ⋮ Needed reduction and spine strategies for the lambda calculus ⋮ Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics ⋮ Abstract data type systems ⋮ Typed generic traversal with term rewriting strategies ⋮ A short and flexible proof of strong normalization for the calculus of constructions ⋮ Typing correspondence assertions for communication protocols ⋮ Representing model theory in a type-theoretical logical framework ⋮ Hyperformulae, Parallel Deductions and Intersection Types ⋮ Typing Correspondence Assertions for Communication Protocols ⋮ Remarks on Isomorphisms of Simple Inductive Types ⋮ The solutions of two star-height problems for regular trees ⋮ Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering ⋮ The completeness theorem for typing lambda-terms ⋮ Encoding many-valued logic in $\lambda$-calculus ⋮ CPO-models for second order lambda calculus with recursive types and subtyping
This page was built for publication:
