Sciweavers

7529 search results - page 342 / 1506
» The Modula-3 Type System
Sort
View
FSTTCS
1993
Springer
15 years 10 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
HASKELL
2007
ACM
15 years 10 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
HVC
2005
Springer
183views Hardware» more  HVC 2005»
16 years 8 days ago
Detecting Potential Deadlocks with Static Analysis and Run-Time Monitoring
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. A common kind of concurrency error is deadlock, which occurs when a set of thr...
Rahul Agarwal, Liqiang Wang, Scott D. Stoller
320
Voted
ICDE
2008
IEEE
144views Database» more  ICDE 2008»
16 years 8 months ago
QShuffler: Getting the Query Mix Right
The typical workload in a database system consists of a mixture of multiple queries of different types, running concurrently and interacting with each other. Hence, optimizing perf...
Mumtaz Ahmad, Ashraf Aboulnaga, Shivnath Babu, Kam...
POPL
2005
ACM
16 years 7 months ago
Connecting effects and uniqueness with adoption
Abstract. In a previous paper, we discussed how the concepts of uniqueness and effects are interdependent. In this paper, we show how "Adoption and Focus," a proposal for...
John Tang Boyland, William Retert