Sciweavers

8 search results - page 2 / 2
» Higher-order semantic labelling for inductive datatype syste...
Sort
View
TCS
2011
12 years 11 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
ACL
2010
13 years 2 months ago
Towards Open-Domain Semantic Role Labeling
Current Semantic Role Labeling technologies are based on inductive algorithms trained over large scale repositories of annotated examples. Frame-based systems currently make use o...
Danilo Croce, Cristina Giannone, Paolo Annesi, Rob...
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 4 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur