Sciweavers

5415 search results - page 283 / 1083
» The Implementation of Functional Programming Languages
Sort
View
ICALP
2010
Springer
15 years 6 months ago
On the k-Independence Required by Linear Probing and Minwise Independence
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
Mihai Patrascu, Mikkel Thorup
JELIA
2010
Springer
14 years 12 months ago
Coala: A Compiler from Action Languages to ASP
Action languages allow for compactly describing dynamic domains. They are usually implemented by compilation, e.g., to Answer Set Programming. To this end, we developed a tool, cal...
Martin Gebser, Torsten Grote, Torsten Schaub
ISCA
2006
IEEE
125views Hardware» more  ISCA 2006»
15 years 7 months ago
Architectural Semantics for Practical Transactional Memory
Transactional Memory (TM) simplifies parallel programming by allowing for parallel execution of atomic tasks. Thus far, TM systems have focused on implementing transactional stat...
Austen McDonald, JaeWoong Chung, Brian D. Carlstro...
TOOLS
2009
IEEE
15 years 8 months ago
PyGirl: Generating Whole-System VMs from High-Level Prototypes Using PyPy
Abstract. Virtual machines (VMs) emulating hardware devices are generally implemented in low-level languages for performance reasons. This results in unmaintainable systems that ar...
Camillo Bruni, Toon Verwaest
TPHOL
2002
IEEE
15 years 6 months ago
Type-Theoretic Functional Semantics
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
Yves Bertot, Venanzio Capretta, Kuntal Das Barman