3239 search results - page 78 / 648 » A Logical Process Calculus |
100
click to vote
TLCA
1995
Springer
15 years 4 months ago
1995
Springer
We introduce a simply-typed λ-calculus (λ→ exn ) featuring an ML-like exception handling mechanism. This calculus, whose type system corresponds to classical logic through the ...
90
Voted
CORR
2006
Springer
15 years 20 days ago
2006
Springer
This paper describes a method for risk analysis based on the approach used in CRAMM, but instead of using discrete measures for threats and vulnerabilities and lookup tables to de...
100
click to vote
CSL
2006
Springer
15 years 4 months ago
2006
Springer
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
101
Voted
IANDC
2010
14 years 11 months ago
2010
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
ESOP
2012
Springer
13 years 8 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...