19 search results - page 4 / 4 » Recognizability in the Simply Typed Lambda-Calculus |
CORR
2010
Springer
13 years 5 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...
FLAIRS
2006
13 years 8 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...
DLS
2008
13 years 9 months ago
2008
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...