Sciweavers

121 search results - page 13 / 25
» Lazy abstraction
Sort
View
SAC
2004
ACM
14 years 28 days ago
A back-end for GHC based on categorical multi-combinators
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
Ricardo Massa Ferreira Lima, Rafael Dueire Lins, A...
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
13 years 5 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
PEPM
1993
ACM
13 years 11 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
DAC
2006
ACM
14 years 8 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 7 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano