640 search results - page 2 / 128 » Logical types for untyped languages |
CADE
2008
Springer
14 years 5 months ago
2008
Springer
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
GI
2009
Springer
13 years 9 months ago
2009
Springer
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
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...