Sciweavers

1313 search results - page 50 / 263
» Generic Universe Types
Sort
View
CSL
2006
Springer
14 years 5 days ago
Universality Results for Models in Locally Boolean Domains
Abstract. In [6] J. Laird has shown that an infinitary sequential extenPCF has a fully abstract model in his category of locally boolean domains (introduced in [8]). In this paper ...
Tobias Löw, Thomas Streicher
EUSFLAT
2007
193views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
A Universal Integral
Based on a minimal set of axioms we introduce a general integral which can be defined on arbitrary measurable spaces. It acts on measures which are only (finite) monotone set fu...
Erich-Peter Klement, Radko Mesiar, Endre Pap
ICFP
2003
ACM
14 years 8 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
FOAL
2009
ACM
14 years 3 months ago
A type system for functional traversal-based aspects
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
Bryan Chadwick, Karl J. Lieberherr
APLAS
2007
ACM
14 years 15 days ago
More Typed Assembly Languages for Confidentiality
We propose a series of type systems for the information-flow security of assembly code. These systems extend previous work TALC with some timing annotations and associated judgment...
Dachuan Yu