Sciweavers

86 search results - page 9 / 18
» Constructive Data Refinement in Typed Lambda Calculus
Sort
View
148
Voted
DLS
2008
149views Languages» more  DLS 2008»
15 years 5 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
140
Voted
LICS
2009
IEEE
15 years 10 months ago
Psi-calculi: Mobile Processes, Nominal Data, and Logic
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
128
Voted
KBSE
1997
IEEE
15 years 7 months ago
Moving Proofs-As-Programs into Practice
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
James L. Caldwell
150
Voted
BIRTHDAY
2000
Springer
15 years 8 months ago
Pict: a programming language based on the Pi-Calculus
The -calculus o ers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports via simple encodings a wide range of high-level constru...
Benjamin C. Pierce, David N. Turner
135
Voted
ICFP
2008
ACM
16 years 3 months ago
AURA: a programming language for authorization and audit
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
Limin Jia, Jeffrey A. Vaughan, Karl Mazurak, Jianz...