203 search results - page 8 / 41 » Type Theory and the Informal Language of Mathematics |
CALCO
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value lan...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
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...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
PPDP
2005
Springer
14 years 27 days ago
2005
Springer
In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be ...
PADL
2012
Springer
12 years 3 months ago
2012
Springer
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...