scientific article
From MaRDI portal
Publication:2778831
zbMath0981.03029MaRDI QIDQ2778831
Publication date: 21 March 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2044/20440344
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)
Related Items (16)
Linear Dependent Type Theory for Quantum Programming Languages ⋮ From realizability to induction via dependent intersection ⋮ I Got Plenty o’ Nuttin’ ⋮ Monotone recursive types and recursive data representations in Cedille ⋮ Quotients by Idempotent Functions in Cedille ⋮ Extracting functional programs from Coq, in Coq ⋮ A dependent dependency calculus ⋮ The calculus of dependent lambda eliminations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ Is Impredicativity Implicitly Implicit ⋮ Unnamed Item ⋮ Visible Type Application ⋮ The Implicit Calculus of Constructions as a Programming Language with Dependent Types ⋮ Redundancy Elimination for LF
This page was built for publication:
