Sciweavers

3713 search results - page 161 / 743
» Constructing a Calculus of Programs
Sort
View
223
Voted
POPL
2004
ACM
16 years 3 months ago
Asynchronous and deterministic objects
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...
Denis Caromel, Ludovic Henrio, Bernard P. Serpette
CADE
2007
Springer
16 years 3 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
108
Voted
ECOOP
2007
Springer
15 years 9 months ago
Gradual Typing for Objects
Static and dynamic type systems have well-known strengths and weaknesses. In previous work we developed a gradual type system for a functional calculus named λ? →. Gradual typin...
Jeremy G. Siek, Walid Taha
ESOP
2006
Springer
15 years 7 months ago
Haskell Is Not Not ML
We present a typed calculus IL ("intermediate language") which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without fa...
Ben Rudiak-Gould, Alan Mycroft, Simon L. Peyton Jo...
LFCS
2009
Springer
15 years 10 months ago
A Clausal Approach to Proof Analysis in Second-Order Logic
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Br...