590 search results - page 29 / 118 » From Relational Specifications to Logic Programs |
PADL
2009
Springer
14 years 9 months ago
2009
Springer
This paper proposes a declarative description of user interfaces that s from low-level implementation details. In particular, the user interfaces specified in our framework are exe...
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper describes a method of synthesis of asynchronous circuits with relative timing. Asynchronous communication between gates and modules typically utilizes handshakes to ens...
TYPES
2000
Springer
14 years 10 days ago
2000
Springer
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...