Sciweavers

824 search results - page 79 / 165
» Constructing Functional Programs for Grammar Analysis Proble...
Sort
View
POPL
2008
ACM
15 years 10 months ago
Foundations for structured programming with GADTs
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
Patricia Johann, Neil Ghani
CONCUR
2006
Springer
15 years 1 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
CAV
2010
Springer
197views Hardware» more  CAV 2010»
15 years 1 months ago
Abstract Analysis of Symbolic Executions
Analysis of Symbolic Executions Aws Albarghouthi1 , Arie Gurfinkel2 , Ou Wei1,3 , and Marsha Chechik1 1 Department of Computer Science, University of Toronto, Canada 2 Software Eng...
Aws Albarghouthi, Arie Gurfinkel, Ou Wei, Marsha C...
ICFP
2006
ACM
15 years 9 months ago
Extensible programming with first-class cases
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
Matthias Blume, Umut A. Acar, Wonseok Chae
POPL
2009
ACM
15 years 4 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...