Sciweavers

3738 search results - page 85 / 748
» Parametrized Logic Programming
Sort
View
CSCW
2000
ACM
14 years 11 days 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
TPHOL
2009
IEEE
14 years 2 months ago
A Hoare Logic for the State Monad
Abstract. This pearl examines how to verify functional programs written using the state monad. It uses Coq’s Program framework to provide strong specifications for the standard ...
Wouter Swierstra
AI
2006
Springer
13 years 8 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
POPL
2008
ACM
14 years 8 months ago
Much ado about two (pearl): a pearl on parallel prefix computation
This pearl develops a statement about parallel prefix computation in the spirit of Knuth's 0-1-Principle for oblivious sorting algorithms. It turns out that 0-1 is not quite ...
Janis Voigtländer
POPL
1997
ACM
14 years 5 days ago
Pizza into Java: Translating Theory into Practice
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types. Pizza is d...
Martin Odersky, Philip Wadler