Sciweavers

18429 search results - page 83 / 3686
» Typing dynamic typing
Sort
View
GI
2009
Springer
15 years 9 months ago
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
David Sabel, Manfred Schmidt-Schauß, Frederi...
CONCUR
2000
Springer
15 years 8 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
FOAL
2007
ACM
15 years 8 months ago
Aspect-oriented programming with type classes
We consider the problem of adding aspects to a strongly typed language which supports type classes. We show that type classes as supported by the Glasgow Haskell Compiler can mode...
Martin Sulzmann, Meng Wang
JFP
2002
108views more  JFP 2002»
15 years 4 months ago
A calculus with polymorphic and polyvariant flow types
We present CIL , a typed -calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. Th...
J. B. Wells, Allyn Dimock, Robert Muller, Franklyn...
ICFP
2006
ACM
16 years 4 months ago
Simple unification-based type inference for GADTs
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...