Sciweavers

397 search results - page 35 / 80
» The Kell Calculus: Operational Semantics and Type System
Sort
View
ENTCS
2002
134views more  ENTCS 2002»
13 years 7 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
PPDP
2005
Springer
14 years 1 months ago
Isolation-only transactions by typing and versioning
In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be ...
Pawel T. Wojciechowski
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 1 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
HASKELL
2006
ACM
14 years 1 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
CSL
2008
Springer
13 years 9 months ago
Type-Based Termination with Sized Products
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
Gilles Barthe, Benjamin Grégoire, Colin Rib...