Sciweavers

4716 search results - page 579 / 944
» Tangible functional programming
Sort
View
CONCUR
2006
Springer
15 years 10 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
ESOP
2006
Springer
15 years 10 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner
FOSSACS
2006
Springer
15 years 10 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...
VLDB
1995
ACM
150views Database» more  VLDB 1995»
15 years 10 months ago
Procedures in Object-Oriented Query Languages
We follow the stack-baaed approach to query languages which is a new formal and intellectual paradigm for integrating querying and programming for object-oriented databases. Queri...
Kazimierz Subieta, Yahiko Kambayashi, Jacek Leszcz...
FOSSACS
2010
Springer
15 years 10 months ago
Untyped Recursion Schemes and Infinite Intersection Types
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
Takeshi Tsukada, Naoki Kobayashi