Sciweavers

3562 search results - page 73 / 713
» Introduction to Logic Programming
Sort
View
CADE
2001
Springer
15 years 10 months ago
A New Meta-complexity Theorem for Bottom-Up Logic Programs
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
Harald Ganzinger, David A. McAllester
LPAR
1992
Springer
15 years 1 months ago
From the Past to the Future: Executing Temporal Logic Programs
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
Michael Fisher, Richard Owens
FMCAD
2008
Springer
14 years 11 months ago
Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques
We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in wh...
George Hagen, Cesare Tinelli
ICFP
2008
ACM
15 years 9 months ago
A type-preserving compiler in Haskell
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...
Louis-Julien Guillemette, Stefan Monnier
CSCW
2000
ACM
15 years 2 months ago
Composable collaboration infrastructures based on programming patterns
In general, collaboration infrastructures have supported sharing of an object based on its logical structure. However, current implementations assume an implicit binding between t...
Vassil Roussev, Prasun Dewan, Vibhor V. Jain