scientific article; zbMATH DE number 733666
From MaRDI portal
Publication:4325974
zbMath0819.03006MaRDI QIDQ4325974
Publication date: 13 March 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information storage and retrieval of data (68P20) Combinatory logic and lambda calculus (03B40)
Related Items (18)
Cartesian isomorphisms are symmetric monoidal: A justification of linear logic ⋮ Extensional proofs in a propositional logic modulo isomorphisms ⋮ Proof theory of higher-order equations: Conservativity, normal forms and term rewriting. ⋮ On the building of affine retractions ⋮ An algebraic theory for web service contracts ⋮ A verified framework for higher-order uncurrying optimizations ⋮ Remarks on Isomorphisms of Simple Inductive Types ⋮ Remarks on isomorphisms in typed lambda calculi with empty and sum types ⋮ Unnamed Item ⋮ Contract-based discovery of Web services modulo simple orchestrators ⋮ Functional pearl: the distributive \(\lambda\)-calculus ⋮ Automorphisms of types and their applications ⋮ Normalisation of the TheoryTof Cartesian Closed Categories and Conservativity of ExtensionsT[x ofT] ⋮ Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering ⋮ Automorphisms of types in certain type theories and representation of finite groups ⋮ Efficient and flexible matching of recursive types ⋮ Natural deduction systems for intuitionistic logic with identity ⋮ A coinductive completeness proof for the equivalence of recursive types
Uses Software
This page was built for publication:
