25 search results - page 4 / 5 » A Self-dependency Constraint in the Simply Typed Lambda Calc... |
FLOPS
2004
Springer
13 years 11 months ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
PPDP
2010
Springer
13 years 4 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
POPL
2003
ACM
14 years 6 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
FLAIRS
2006
13 years 7 months ago
2006
Extensible Dependency Grammar (XDG) is new, modular grammar formalism for natural language. An XDG analysis is a multi-dimensional dependency graph, where each dimension represent...