Format | |
---|---|
BibTeX | |
MARCXML | |
TextMARC | |
MARC | |
DublinCore | |
EndNote | |
NLM | |
RefWorks | |
RIS |
Linked e-resources
Details
Table of Contents
Logic/Constraint Programming and Concurrency: The Hard-Won Lessons of the Fifth Generation Computer Project
From Sets to Bits in Coq
From proposition to program: embedding the refinement calculus in Coq
The Boolean Constraint Solver of SWI-Prolog: System Description
Probabilistic inference by program transformation in Hakaru: System description
An interaction net encoding of Godel's System T
Space-efficient Planar Acyclicity Constraints: A Declarative Pearl
Executable Relational Specifications of Polymorphic Type Systems using Prolog
Proof Relevant Corecursive Resolution
A Coq Library For Internal Verification of Running-Times
A Transformational Approach to Parametric Accumulated-cost Static Profiling
Polymorphic Types in Erlang Function Specifications
Declarative foreign function binding through generic programming
Declarative Programming with Algebra.
From Sets to Bits in Coq
From proposition to program: embedding the refinement calculus in Coq
The Boolean Constraint Solver of SWI-Prolog: System Description
Probabilistic inference by program transformation in Hakaru: System description
An interaction net encoding of Godel's System T
Space-efficient Planar Acyclicity Constraints: A Declarative Pearl
Executable Relational Specifications of Polymorphic Type Systems using Prolog
Proof Relevant Corecursive Resolution
A Coq Library For Internal Verification of Running-Times
A Transformational Approach to Parametric Accumulated-cost Static Profiling
Polymorphic Types in Erlang Function Specifications
Declarative foreign function binding through generic programming
Declarative Programming with Algebra.