71 search results - page 8 / 15 » An Abstract Way to Define Rewriting Logic |
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
103
click to vote
WFLP
2000
Springer
15 years 1 months ago
2000
Springer
We describe the current status of the development of CFLP, a system which aims at the integration of the best features of functional logic programming (FLP), cooperative constrain...
ICFP
2000
ACM
15 years 2 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
ENTCS
2006
14 years 10 months ago
2006
Industry is looking to create a market in reliable "plug-and-play" components. To model components in a modular style it would be useful to combine event-based and state...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...