scientific article; zbMATH DE number 1552509

zbMath1015.68177MaRDI QIDQ4524766

Holger Benl, Wolfgang Zuber, Monika Seisenberger, Ulrich Berger, Helmut Schwichtenberg

Publication date: 29 July 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

search algorithmMINLOG

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (13)

Extracting a DPLL Algorithm ⋮ Intuitionistic completeness of first-order logic ⋮ A realizability interpretation of Church's simple theory of types ⋮ Unifying sets and programs via dependent types ⋮ Term rewriting for normalization by evaluation. ⋮ On the Constructive and Computational Content of Abstract Mathematics ⋮ Proofs, programs, processes ⋮ Programs from proofs using classical dependent choice ⋮ Proof-theoretic notions for software maintenance ⋮ Uniform Heyting arithmetic ⋮ Axioms for strict and lazy functional programs ⋮ Unifying Sets and Programs via Dependent Types ⋮ From Coinductive Proofs to Exact Real Arithmetic

This page was built for publication: