Sciweavers

640 search results - page 43 / 128
» Logical types for untyped languages
Sort
View
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 9 months ago
Logic Meets Algebra: the Case of Regular Languages
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
Pascal Tesson, Denis Thérien
APLAS
2004
ACM
14 years 22 days ago
History Effects and Verification
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher-order programs. The ...
Christian Skalka, Scott F. Smith
JUCS
2006
175views more  JUCS 2006»
13 years 9 months ago
The Design of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...
Anderson Faustino da Silva, Vítor Santos Co...
ENTCS
2008
99views more  ENTCS 2008»
13 years 9 months ago
Specifying Properties of Concurrent Computations in CLF
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...
Kevin Watkins, Iliano Cervesato, Frank Pfenning, D...
ILP
1998
Springer
14 years 1 months ago
Strongly Typed Inductive Concept Learning
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
Peter A. Flach, Christophe G. Giraud-Carrier, John...