Sciweavers

223 search results - page 10 / 45
» Types, Maps and Separation Logic
Sort
View
TLCA
2009
Springer
15 years 10 months ago
Algebraic Totality, towards Completeness
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...
Christine Tasson
136
Voted
FCCM
2003
IEEE
135views VLSI» more  FCCM 2003»
15 years 8 months ago
Efficient Application Representation for HASTE: Hybrid Architectures with a Single, Transformable Executable
Hybrid architectures, which are composed of a conventional processor closely coupled with reconfigurable logic, seem to combine the advantages of both types of hardware. They pres...
Benjamin A. Levine, Herman Schmit
128
Voted
FOSSACS
2009
Springer
15 years 10 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
127
Voted
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
16 years 12 days ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
143
Voted
PLPV
2009
ACM
16 years 12 days ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper