Sciweavers

1614 search results - page 194 / 323
» Polymorphism and Genetic Programming
Sort
View
GI
2009
Springer
14 years 3 months ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer
ECOOP
1998
Springer
14 years 3 months ago
Object-Oriented Architectural Support for a Java Processor
In this paper, we propose architectural support for object manipulation, stack processing and method invocation to enhance the execution speed of Java bytecodes. First, a virtual a...
Narayanan Vijaykrishnan, N. Ranganathan, Ravi Gade...
POPL
1993
ACM
14 years 3 months ago
Type Checking Type Classes
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
Tobias Nipkow, Christian Prehofer
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
14 years 3 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
ICALP
2007
Springer
14 years 2 months ago
Affine Systems of Equations and Counting Infinitary Logic
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
Albert Atserias, Andrei A. Bulatov, Anuj Dawar