scientific article
From MaRDI portal
Publication:3024836
zbMath1063.68565MaRDI QIDQ3024836
Publication date: 4 July 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)
Related Items (14)
On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem ⋮ Programming and Proving with Classical Types ⋮ Strong normalization proofs by CPS-translations ⋮ Unnamed Item ⋮ On the strong normalisation of intuitionistic natural deduction with permutation-conversions ⋮ Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control ⋮ Unnamed Item ⋮ Domain-Freeλµ-Calculus ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ On the concurrent computational content of intermediate logics ⋮ Strong normalization of classical natural deduction with disjunctions ⋮ Strong normalizability of the non-deterministic catch/throw calculi ⋮ A Third-Order Representation of the λμ-Calculus ⋮ Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus
This page was built for publication:
