Sciweavers

1999 search results - page 38 / 400
» Dependently Typed Grammars
Sort
View
POPL
2006
ACM
16 years 2 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
ENTCS
2010
133views more  ENTCS 2010»
15 years 2 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness
ACL
2004
15 years 3 months ago
Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
Gerald Penn
99
Voted
ACL
2006
15 years 3 months ago
Polarized Unification Grammars
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects ...
Sylvain Kahane
LREC
2010
132views Education» more  LREC 2010»
15 years 3 months ago
Hungarian Dependency Treebank
Herein, we present the process of developing the first Hungarian Dependency TreeBank. First, short references are made to dependency grammars we considered important in the develo...
Veronika Vincze, Dóra Szauter, Attila Alm&a...