Sciweavers

61 search results - page 2 / 13
» The Nondirectional Representation Of Systemic Functional Gra...
Sort
View
POPL
2006
ACM
14 years 6 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
JOLLI
2007
88views more  JOLLI 2007»
13 years 5 months ago
Toward discourse representation via pregroup grammars
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...
Anne Preller
COLING
2010
13 years 22 days ago
DL Meet FL: A Bidirectional Mapping between Ontologies and Linguistic Knowledge
We present a transformation scheme that mediates between description logics (DL) or RDF-encoded ontologies and type hierarchies in feature logics (FL). The DL-to-FL direction is i...
Hans-Ulrich Krieger, Ulrich Schäfer
HASKELL
2006
ACM
13 years 11 months ago
Strongly typed memory areas programming systems-level data structures in a functional language
Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programmin...
Iavor S. Diatchki, Mark P. Jones
FINTAL
2006
13 years 9 months ago
A Computational Implementation of Internally Headed Relative Clause Constructions
The so-called Internally Headed Relative Clause (IHRC) construction found in the head-final languages Korean and Japanese has received little attention from computational perspecti...
Jong-Bok Kim, Peter Sells, Jaehyung Yang