Sciweavers

3713 search results - page 416 / 743
» Constructing a Calculus of Programs
Sort
View
JFP
2000
95views more  JFP 2000»
15 years 4 months ago
A modular module system
A simple implementation of an SML-like module system is presented as a module parameterized by a base language and its type-checker. This implementation is useful both as a detail...
Xavier Leroy
ORDER
2002
87views more  ORDER 2002»
15 years 4 months ago
Posets on up to 16 Points
In this article we describe a very efficient method to construct pairwise nonisomorphic posets (equivalently, T0 topologies). We also give the results obtained by a computer progr...
Gunnar Brinkmann, Brendan D. McKay
CALCO
2009
Springer
138views Mathematics» more  CALCO 2009»
15 years 11 months ago
Kleene Monads: Handling Iteration in a Framework of Generic Effects
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
Sergey Goncharov, Lutz Schröder, Till Mossako...
CPAIOR
2009
Springer
15 years 11 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
180
Voted
CADE
1998
Springer
15 years 8 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...