194 search results - page 7 / 39 » A Rewriting Semantics for Type Inference |
POPL
2003
ACM
14 years 7 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...
POPL
2012
ACM
12 years 2 months ago
2012
ACM
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
LFP
1992
13 years 8 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
CICLING
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on logical representatio...