233 search results - page 14 / 47 » Computational Lambda-Calculus and Monads |
BIRTHDAY
2010
Springer
13 years 7 months ago
2010
Springer
Let M = (A, <, P) where (A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type or -, an...
RTA
2001
Springer
13 years 12 months ago
2001
Springer
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to...
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. During the last two decades, monads have become an indispensable tool for structuring functional programs with computational effects. In this setting, the mathematical n...
DOCENG
2003
ACM
14 years 22 days ago
2003
ACM
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tr...
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...