Sciweavers

590 search results - page 79 / 118
» From Relational Specifications to Logic Programs
Sort
View
ICFP
2003
ACM
14 years 8 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
APAL
2008
104views more  APAL 2008»
13 years 9 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
VLDB
2007
ACM
118views Database» more  VLDB 2007»
14 years 9 months ago
Eliminating Impedance Mismatch in C++
Recently, the C# and the VISUAL BASIC communities were tantalized by the advent of LINQ [18]--the Language INtegrated Query technology from Microsoft. LINQ represents a set of lan...
Joseph Gil, Keren Lenz
SIGARCH
2008
107views more  SIGARCH 2008»
13 years 8 months ago
A lightweight streaming layer for multicore execution
As multicore architectures gain widespread use, it becomes increasingly important to be able to harness their additional processing power to achieve higher performance. However, e...
David Zhang, Qiuyuan J. Li, Rodric Rabbah, Saman A...
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 5 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard