Sciweavers

1989 search results - page 72 / 398
» Set functions for functional logic programming
Sort
View
BIRTHDAY
2010
Springer
13 years 11 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
DAGSTUHL
2003
14 years 1 days ago
Embedding a Hardware Description Language in Template Haskell
Abstract. Hydra is a domain-specific language for designing digital circuits, which is implemented by embedding within Haskell. Many features required for hardware specification ...
John T. O'Donnell
TPHOL
2009
IEEE
14 years 5 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
MP
2011
13 years 1 months ago
Implicit solution function of P0 and Z matrix linear complementarity constraints
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
Xiaojun Chen, Shuhuang Xiang
ENTCS
2000
83views more  ENTCS 2000»
13 years 10 months ago
Typed Logical Variables in Haskell
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
Koen Claessen, Peter Ljunglöf