159 search results - page 3 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
CONCUR
2010
Springer
15 years 21 days ago
2010
Springer
Abstract. We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are ...
IJISEC
2007
14 years 11 months ago
2007
This paper presents a language in which information flow is securely controlled by a type system, yet the security class of data can vary dynamically. Information flow policies ...
103
click to vote
DOCENG
2003
ACM
15 years 4 months 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...
ENTCS
2008
14 years 11 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
112
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...