367 search results - page 36 / 74 » A Rewriting Logic Sampler |
TLCA
2007
Springer
14 years 2 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
ACL
1993
13 years 9 months ago
1993
We show that feature logic extended by functional uncertainty is decidable, even if one admits cyclic descriptions. We present an algorithm, which solves feature descriptions cont...
INFORMATICALT
2000
13 years 7 months ago
2000
The paper presents a simple programming language and rewriting system called GENS. It is based on an extension of the -calculus called E-calculus. GENS is a multiparadigm language:...
CSFW
1999
IEEE
14 years 8 days ago
1999
IEEE
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
PPDP
1999
Springer
14 years 6 days ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...