Sciweavers

1174 search results - page 170 / 235
» A Logical Approach to Abstract Algebra
Sort
View
ENTCS
2007
100views more  ENTCS 2007»
15 years 4 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
JCB
1998
105views more  JCB 1998»
15 years 4 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
AI
2008
Springer
15 years 5 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
MCMASTER
1993
15 years 9 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
DEDS
2000
83views more  DEDS 2000»
15 years 4 months ago
Synthesis of Discrete-Event Controllers Based on the Signal Environment
In this paper, we present the integration of controller synthesis techniques in the SIGNAL environment through the description of a tool dedicated to the incremental construction o...
Hervé Marchand, Patricia Bournai, Michel Le...