Sciweavers

251 search results - page 14 / 51
» Pure Type Systems without Explicit Contexts
Sort
View
ICFP
2002
ACM
14 years 7 months ago
Tagless staged interpreters for typed languages
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
Emir Pasalic, Walid Taha, Tim Sheard
ESOP
2009
Springer
14 years 2 months ago
Practical Variable-Arity Polymorphism
Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scr...
T. Stephen Strickland, Sam Tobin-Hochstadt, Matthi...
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
13 years 11 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
POPL
2010
ACM
14 years 5 months ago
Integrating Typed and Untyped Code in a Scripting Language
Many large software systems originate from untyped scripting language code. While good for initial development, the lack of static type annotations can impact code-quality and per...
Francesco Zappa Nardelli, Jan Vitek, Johan Ös...
ACL
1997
13 years 9 months ago
Ambiguity Resolution for Machine Translation of Telegraphic Messages
Telegraphic messages with numerous instances of omission pose a new challenge to parsing in that a sentence with omission causes a higher degree of ambi6uity than a sentence witho...
Young-Suk Lee, Clifford J. Weinstein, Stephanie Se...