| Cervesato, I., F. Pfenning, D. Walker and K. Watkins, A concurrent logical framework II: Examples and applications, Technical Report CMU-CS-02-102, Computer Science Department, Carnegie Mellon University (2002). |
No context found.
Cervesato, I., F. Pfenning, D. Walker and K. Watkins, A concurrent logical framework II: Examples and applications, Technical Report CMU-CS-02-102, Computer Science Department, Carnegie Mellon University (2002).
No context found.
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02102, Department of Computer Science, Carnegie Mellon University, 2002.
No context found.
Cervesato, I., F. Pfenning, D. Walker and K. Watkins, A concurrent logical framework II: Examples and applications, Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University (
No context found.
I. Cervesato, F. Pfenning, D. Walker, and K. Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Computer Science Department, Carnegie Mellon University, 2002.
No context found.
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002.
No context found.
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002. Revised May 2003.
No context found.
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Carnegie Mellon University, March 2002. At: http://www-2.cs.cmu.edu/fp/papers/CMU-CS-02-102.pdf.
No context found.
I. Cervesato, F. Pfenning, D. Walker, and K. Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002.
No context found.
Cervesato, I., F. Pfenning, D. Walker and K. Watkins, A concurrent logical framework II: Examples and applications, Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University (
No context found.
Cervesato, I., Pfenning, F., Walker, D., Watkins, K.: A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University (2002) Revised May 2003. 15
No context found.
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework ii: Examples and applications. Technical Report CMU-CS-02101, Department of Computer Science, Carnegie Mellon University, March 2002.
No context found.
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002. Revised May 2003.
No context found.
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002.
....The new formulation of the framework constitutes an original contribution even for the LF fragment. For many additional examples illustrating the use of the framework to specify and reason about object systems of interest, the reader is referred to the companion technical report on applications [CPWW02]. Keywords: logical frameworks, type theory, linear logic, concurrency Contents 1 Introduction 3 2 A type theory with concurrent terms 4 2.1 A language of concurrent objects . 4 2.2 The type system of CLF . ....
....the synchronous connectives , 1, and 9 of intuitionistic linear logic. We call this new framework Concurrent LF (CLF) The purpose of this report is to describe the language and meta theory of CLF. Readers interested in examples of CLF representations can consult the companion report [CPWW02], which demonstrates the expressive power of CLF through a series of examples and, in particular, focuses on CLF s e ectiveness for encoding concurrent programming paradigms. Summary. The remainder of the report is organized as follows. Section 2 introduces the CLF type theory, including its ....
[Article contains additional citation context not shown here]
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002. Forthcoming.
....already exhibits the principal phenomena concerning concurrency. The use of the framework is illustrated by an encoding of Petri net computations because of their simplicity, but related representations for the calculus, Concurrent ML, and other languages with concurrency have also been devised [CPWW02]. The representation technique for all of these examples can be summarized as con current computations as monadic expressions . The remainder is organized as follows. Section 2 de nes CLF 0 , including its syntax and typing rules. It also introduces the Petri net example and contrasts ....
....) u) u ; x : A x ) A x ; 1 R ) A B ; 2 N ( A ; 1 ; 2 R N ) B ; R ) A B ; N ( A ; R N ) B E ; 1R ) A ; 2R ) B Fig. 1. Typing rules for LLF0 only given by example. Further details may be found in the companion applications technical report [CPWW02]. Each place in a Petri net is represented by a type constant p. The state of the net is represented as a collection of linear hypotheses: there is an assumption x : p for every token in place p. There is also a separate type constant X representing an (unspeci c) goal state. For each ....
[Article contains additional citation context not shown here]
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002. Forthcoming.
....The new formulation of the framework constitutes an original contribution even for the LF fragment. For many additional examples illustrating the use of the framework to specify and reason about object systems of interest, the reader is referred to the companion technical report on applications [CPWW02]. Keywords: logical frameworks, type theory, linear logic, concurrency Contents 1 Introduction 3 2 A type theory with concurrent terms 4 2.1 A language of concurrent objects . 4 2.2 The type system of CLF . ....
....that incorporates the synchronous connectives# of intuitionistic linear logic. We call this new framework Concurrent LF (CLF) The purpose of this report is to describe the language and meta theory of CLF. Readers interested in examples of CLF representations can consult the companion report [CPWW02], which demonstrates the expressive power of CLF through a series of examples and, in particular, focuses on CLF s e#ectiveness for encoding concurrent programming paradigms. Summary. The remainder of the report is organized as follows. Section 2 introduces the CLF type theory, including its ....
[Article contains additional citation context not shown here]
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002. Forthcoming.
....already exhibits the principal phenomena concerning concurrency. The use of the framework is illustrated by an encoding of Petri net computations because of their simplicity, but related representations for the # calculus, Concurrent ML, and other languages with concurrency have also been devised [CPWW02]. The representation technique for all of these examples can be summarized as con current computations as monadic expressions . The remainder is organized as follows. Section 2 defines CLF 0 , including its syntax and typing rules. It also introduces the Petri net example and contrasts ....
....# # I # ## # # #I a ## #(c) c # (u) # ; x # : A x A # B # ; #2 B #E A#B # ; B #E Fig. 1. Typing rules for LLF0 only given by example. Further details may be found in the companion applications technical report [CPWW02]. Each place in a Petri net is represented by a type constant p. The state of the net is represented as a collection of linear hypotheses: there is an assumption x : p for every token in place p. There is also a separate type constant X representing an (unspecific) goal state. For each ....
[Article contains additional citation context not shown here]
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002. Forthcoming.
No context found.
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Computer Science Department, Carnegie Mellon University, May 2003.
No context found.
Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, Mar. 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC