Sciweavers

596 search results - page 83 / 120
» Subtyping Recursive Types
Sort
View
CEFP
2009
Springer
14 years 11 months 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
14 years 11 months 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 7 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...
ECOOP
1998
Springer
15 years 5 months ago
Synthesizing Object-Oriented and Functional Design to Promote Re-Use
Many problems require recursively speci ed types ofdata and a collection of tools that operate on those data. Over time, these problems evolve so that the programmer must extend t...
Shriram Krishnamurthi, Matthias Felleisen, Daniel ...
CORR
2006
Springer
141views Education» more  CORR 2006»
15 years 1 months ago
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input outp...
Chun-Hao Hsu, Achilleas Anastasopoulos