Sciweavers

29 search results - page 5 / 6
» Free Adjunction of Morphisms
Sort
View
LICS
2005
IEEE
14 years 28 days ago
A Functional Quantum Programming Language
We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by ...
Thorsten Altenkirch, Jonathan Grattage
LOGCOM
2007
125views more  LOGCOM 2007»
13 years 7 months ago
Epistemic Actions as Resources
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommoda...
Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh
NLPRS
2001
Springer
13 years 11 months ago
Resolving Ambiguity in Inter-chunk Dependency Parsing
Recently, dependency grammar has become quite popular in relatively free word-order languages. We encounter many structural ambiguities when parsing a sentence using dependency gr...
Mi-Young Kim, Sin-Jae Kang, Jong-Hyeok Lee
ACL
1990
13 years 8 months ago
Lexical and Syntactic Rules in a Tree Adjoining Grammar
according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
Anne Abeillé
CAI
2011
Springer
12 years 11 months ago
Theme and Variations on the Concatenation Product
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...
Jean-Éric Pin