367 search results - page 58 / 74 » A Rewriting Logic Sampler |
140
Voted
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
CADE
1994
Springer
15 years 4 months ago
1994
Springer
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
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...
100
Voted
FMSD
2006
15 years 12 days ago
2006
This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast...
121
Voted
ENTCS
2007
15 years 11 days ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...