Sciweavers

4192 search results - page 495 / 839
» Probabilistic Logic Programming
Sort
View
146
Voted
ICFP
2008
ACM
16 years 4 months ago
Type checking with open type functions
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
Tom Schrijvers, Simon L. Peyton Jones, Manuel M. T...
ICFP
2004
ACM
16 years 4 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher
TACAS
2010
Springer
142views Algorithms» more  TACAS 2010»
15 years 11 months ago
Tracking Heaps That Hop with Heap-Hop
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
Jules Villard, Étienne Lozes, Cristiano Cal...
ACL2
2006
ACM
15 years 10 months ago
Adding parallelism capabilities to ACL2
We have implemented parallelism primitives that permit an ACL2 programmer to parallelize execution of ACL2 functions. We (1) introduce logical definitions for these primitives, (...
David L. Rager
TLDI
2005
ACM
126views Formal Methods» more  TLDI 2005»
15 years 10 months ago
Type inference for atomicity
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
Cormac Flanagan, Stephen N. Freund, Marina Lifshin