660 search results - page 50 / 132 » The Implicit Calculus of Constructions |
170
click to vote
AAECC
2006
Springer
15 years 5 months ago
2006
Springer
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. ...
279
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
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...
138
click to vote
FOSSACS
2010
Springer
16 years 17 days ago
2010
Springer
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
156
click to vote
SECURWARE
2008
IEEE
16 years 3 days ago
2008
IEEE
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...
191
click to vote
QEST
2007
IEEE
16 years 17 hour ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...