Sciweavers

13734 search results - page 191 / 2747
» Abstractions of data types
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...
ICFP
2009
ACM
16 years 5 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
IWPC
1999
IEEE
15 years 8 months ago
Understanding COBOL Systems using Inferred Types
In a typical COBOL program, the data division consists of 50% of the lines of code. Automatic type inference can help to understand the large collections of variable declarations ...
Arie van Deursen, Leon Moonen
FLOPS
2008
Springer
15 years 5 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
CONCUR
2010
Springer
15 years 5 months ago
Session Types for Access and Information Flow Control
We consider a calculus for multiparty sessions with delegation, enriched with security levels for session participants and data. We propose a type system that guarantees both sessi...
Sara Capecchi, Ilaria Castellani, Mariangiola Deza...