Sciweavers

660 search results - page 50 / 132
» The Implicit Calculus of Constructions
Sort
View
AAECC
2006
Springer
102views Algorithms» more  AAECC 2006»
13 years 10 months ago
An effective proof of the well-foundedness of the multiset path ordering
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
Solange Coupet-Grimal, William Delobel
POPL
2008
ACM
14 years 10 months ago
A logical account of pspace
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
FOSSACS
2010
Springer
14 years 4 months ago
Monads Need Not Be Endofunctors
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
Thorsten Altenkirch, James Chapman, Tarmo Uustalu
SECURWARE
2008
IEEE
14 years 4 months ago
From Monitoring Templates to Security Monitoring and Threat Detection
Abstract. This paper presents our pattern-based approach to run-time requirements monitoring and threat detection being developed as part of an approach to build frameworks support...
Nuno Amálio, George Spanoudakis
QEST
2007
IEEE
14 years 4 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin