Sciweavers

57 search results - page 9 / 12
» A monadic approach to polycategories
Sort
View
CP
2006
Springer
14 years 1 months ago
Generating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
Guido Tack, Christian Schulte, Gert Smolka
HASKELL
2006
ACM
14 years 3 months ago
Running the manual: an approach to high-assurance microkernel development
We propose a development methodology for designing and prototyping high assurance microkernels, and describe our application of it. The methodology is based on rapid prototyping a...
Philip Derrin, Kevin Elphinstone, Gerwin Klein, Da...
DIMACS
1996
13 years 11 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
ENTCS
2002
125views more  ENTCS 2002»
13 years 9 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 9 months ago
Approximation in quantale-enriched categories
Our work is a fundamental study of the notion of approximation in Q-categories and in (U, Q)-categories, for a quantale Q and the ultrafilter monad U. We introduce auxiliary, appro...
Dirk Hofmann, Pawel Waszkiewicz