Sciweavers

933 search results - page 107 / 187
» Multi-paradigm Declarative Languages
Sort
View
114
Voted
ICFP
2010
ACM
15 years 5 months ago
The gentle art of levitation
We present a closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe. Each inductive datatype arise...
James Chapman, Pierre-Évariste Dagand, Cono...
ENTCS
2006
184views more  ENTCS 2006»
15 years 4 months ago
Scannerless Boolean Parsing
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
Adam Megacz
AI
2005
Springer
15 years 4 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
JAR
2007
72views more  JAR 2007»
15 years 4 months ago
Inferring Phylogenetic Trees Using Answer Set Programming
We describe the reconstruction of a phylogeny for a set of taxa, with a character-based cladistics approach, in a declarative knowledge representation formalism, and show how to u...
Daniel R. Brooks, Esra Erdem, Selim T. Erdogan, Ja...
137
Voted
CC
2002
Springer
100views System Software» more  CC 2002»
15 years 4 months ago
Disambiguation Filters for Scannerless Generalized LR Parsers
In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax definitions in which all aspects (lexical and context-free) ...
Mark van den Brand, Jeroen Scheerder, Jurgen J. Vi...