Sciweavers

5415 search results - page 839 / 1083
» The Implementation of Functional Programming Languages
Sort
View
APAL
2008
90views more  APAL 2008»
15 years 6 months ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger
168
Voted
JAR
2008
89views more  JAR 2008»
15 years 6 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff
CORR
2004
Springer
123views Education» more  CORR 2004»
15 years 6 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
202
Voted
SIGSOFT
2010
ACM
15 years 4 months ago
Separation of concerns for dependable software design
For `mixed-criticality' systems that have both critical and non-critical functions, the greatest leverage on dependability may be at the design level. By designing so that ea...
Daniel Jackson, Eunsuk Kang
CIE
2009
Springer
16 years 1 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy