Sciweavers

680 search results - page 49 / 136
» Types for the Ambient Calculus
Sort
View
ENTCS
2002
66views more  ENTCS 2002»
13 years 8 months ago
Strongly Normalising Cut-Elimination with Strict Intersection Types
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
Steffen van Bakel
ICCAD
2003
IEEE
166views Hardware» more  ICCAD 2003»
14 years 5 months ago
Fault-Tolerant Techniques for Ambient Intelligent Distributed Systems
Ambient Intelligent Systems provide an unexplored hardware platform for executing distributed applications under strict energy constraints. These systems must respond quickly to c...
Diana Marculescu, Nicholas H. Zamora, Phillip Stan...
APAL
2000
61views more  APAL 2000»
13 years 8 months ago
Higher type recursion, ramification and polynomial time
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...
Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Sc...
ACS
2005
13 years 9 months ago
Relating Categorical Semantics for Intuitionistic Linear Logic
There are several kinds of linear typed calculus in the literature, some with their associated notion of categorical model. Our aim in this paper is to systematise the relationshi...
Maria Emilia Maietti, Paola Maneggia, Valeria de P...
FOSSACS
2004
Springer
14 years 2 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil