Sciweavers

3001 search results - page 84 / 601
» Recursive type generativity
Sort
View
CEFP
2009
Springer
15 years 9 days ago
Reasoning about Codata
Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. ...
Ralf Hinze
EUROPAR
2009
Springer
15 years 8 days ago
Argument Controlled Profiling
Profiling tools relate measurements to code context such as function names in order to guide code optimization. For a more detailed analysis, call path or phase-based profiling enh...
Tilman Küstner, Josef Weidendorfer, Tobias We...
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
15 years 8 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
15 years 8 months ago
RepLib: a library for derivable type classes
Some type class instances can be automatically derived from the structure of types. As a result, the Haskell language includes the “deriving” mechanism to automatic generates ...
Stephanie Weirich
105
Voted
VMCAI
2004
Springer
15 years 7 months ago
Type Inference for Parameterized Race-Free Java
Abstract. We study the type system introduced by Boyapati and Rinard in their paper “A Parameterized Type System for Race-Free Java Programs” and try to infer the type annotati...
Rahul Agarwal, Scott D. Stoller