1999 search results - page 122 / 400 » Dependently Typed Grammars |
165
click to vote
COLING
2010
15 years 1 months ago
2010
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
162
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
314
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Web applications typically interact with a back-end database to retrieve persistent data and then present the data to the user as dynamically generated output, such as HTML web pa...
163
click to vote
COLING
1992
15 years 7 months ago
1992
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
268
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...