Sciweavers

10 search results - page 1 / 2
» Extending Definite Clause Grammars with Scoping Constructs
Sort
View
ICLP
1990
Springer
13 years 9 months ago
Extending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
Remo Pareschi, Dale Miller
ENTCS
2008
140views more  ENTCS 2008»
13 years 5 months ago
Functions and Lazy Evaluation in Prolog
There are several proposals for extending Prolog with functional capabilities. The basic idea is to enlarge the language with function definitions that are translated (or expanded...
Juan Rodríguez-Hortalá, Jaime S&aacu...
DBPL
1993
Springer
104views Database» more  DBPL 1993»
13 years 9 months ago
Extensible Grammars for Language Specialization
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
Luca Cardelli, Florian Matthes, Martín Abad...
ENTCS
2010
84views more  ENTCS 2010»
13 years 2 months ago
Syntactic Language Extension via an Algebra of Languages and Transformations
We propose an algebra of languages and transformations as a means for extending s syntactically. The algebra provides a layer of high-level abstractions built on top of languages ...
Jacob Andersen, Claus Brabrand
ICFP
2005
ACM
14 years 5 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney