Sciweavers

273 search results - page 16 / 55
» Extensible Grammars for Language Specialization
Sort
View
EACL
1993
ACL Anthology
13 years 8 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte
EMNLP
2009
13 years 5 months ago
A Syntactified Direct Translation Model with Linear-time Decoding
Recent syntactic extensions of statistical translation models work with a synchronous context-free or tree-substitution grammar extracted from an automatically parsed parallel cor...
Hany Hassan, Khalil Sima'an, Andy Way
ENTCS
2008
140views more  ENTCS 2008»
13 years 7 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...
ESOP
2001
Springer
13 years 12 months ago
Encoding Intensional Type Analysis
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
Stephanie Weirich
HASKELL
2009
ACM
14 years 2 months ago
The architecture of the Utrecht Haskell compiler
In this paper we describe the architecture of the Utrecht Haskell Compiler (UHC). UHC is a new Haskell compiler, that supports most (but not all) Haskell 98 features, plus some ex...
Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra