Gregory, S. and Ramirez, R. 1995.Tempo: a declarative concurrent programming language. Proceedings of the twelfth International Conference on Logic Programming, Sterling, L. ed. #Tokyo, June#, MIT Press, 1995.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Logic-Based Concurrent Object-Oriented Programming Language - Melendez (1997) (Correct)
....properties hold during program execution. Thus, a declarative specification of a concurrent system must explicitly describe such properties. We propose a concurrent programming language in which all safety properties of a concurrent program can be stated declaratively. Our language, Tempo [Gregory and Ramirez 95] is based on classical first order logic and has a procedural interpretation which allows specifications to be executed as concurrent programs. Tempo explicitly describes processes (called activities to reserve the term process for the computational processes) as partially ordered sets of ....
Gregory, S. and Ramirez, R. 1995. Tempo: a declarative concurrent programming language. Proceedings of the twelfth International Conference on Logic Programming, Sterling, L. ed. (Tokyo, June), MIT Press, 1995.
A Logic-Based Concurrent Object-Oriented - Programming Language Rafael Self-citation (Gregory Ramirez) (Correct)
No context found.
Gregory, S. and Ramirez, R. 1995.Tempo: a declarative concurrent programming language. Proceedings of the twelfth International Conference on Logic Programming, Sterling, L. ed. #Tokyo, June#, MIT Press, 1995.
Executable Specifications for Concurrent Programming - Jaffar, Ramirez, Yap Self-citation (Ramirez) (Correct)
....is decidable. 4 Logic Programs for Synchronization There have been several proposals to use partially ordered sets of events for reasoning about concurrency (e.g. 11] 12] The approach described in this section is based on the same general idea, and is strongly related to the language Tempo [5], 13] The basic idea here is to use a constraint logic program (CLP) to represent the (usually infinite) set of constraints of interest. The constraints themselves are of the form X OE Y , read as X precedes Y , where X; Y are events, and OE is a partial order. The CLP programs used are ....
Gregory, S. and Ramirez, R. 1995. Tempo: a declarative concurrent programming language. Proc.of the ICLP (Tokyo, June), MIT Press, 1995.
Representing and Executing Real-Time Systems - Ramirez Self-citation (Ramirez) (Correct)
....synchronisation schemes without modifying the timing requirements and vice versa. Also, a synchronisation time scheme may be reused by several applications. This provides great advantages in terms of program flexibility, reuse and debugging. 2 Related work This work is strongly related to Tempo ([8]) and Tempo ( 17] 16] Tempo is a declarative concurrent programming language based on first order logic. It is declarative in the sense that a Tempo program is both an algorithm and a specification of the safety properties of the algorithm. Tempo extends Tempo (as presented in [8] by ....
....to Tempo ( 8] and Tempo ( 17] 16] Tempo is a declarative concurrent programming language based on first order logic. It is declarative in the sense that a Tempo program is both an algorithm and a specification of the safety properties of the algorithm. Tempo extends Tempo (as presented in [8]) by adding numbers and data structures (and operations and constraints on them) as well as supporting object oriented programming. Both languages explicitly described processes as partially ordered set of events. Events are executed in the specified order, but their execution times are only ....
[Article contains additional citation context not shown here]
Gregory, S. and Ramirez, R. 1995. Tempo: a declarative concurrent programming language. Proc.of the ICLP (Tokyo, June), MIT Press, 1995.
Derivation of Concurrent Algorithms in Tempo - Gregory (1995) (4 citations) Self-citation (Gregory) (Correct)
....view, it is premature to abandon the ideal of declarative concurrent programming: instead of removing the logic from concurrent logic programming, we should attempt to design languages that are more declarative than existing ones. We have moved a step in this direction with the design of Tempo (Gregory and Ramirez, 1995). Tempo is a concurrent programming language based on classical first order logic which allows all safety properties to be stated declaratively, not only the program s final result. In the next section we give a brief outline of Tempo, a full description of which can be found in (Gregory and ....
....and Ramirez, 1995) Tempo is a concurrent programming language based on classical first order logic which allows all safety properties to be stated declaratively, not only the program s final result. In the next section we give a brief outline of Tempo, a full description of which can be found in (Gregory and Ramirez, 1995). Section#3 demonstrates how a specification of a classic concurrent programming problem can be transformed into various algorithms, all guaranteed to have the specified safety properties. The original contribution of this paper is the transformation method described and illustrated in Section#3, ....
[Article contains additional citation context not shown here]
Gregory, S. and Ramirez, R. 1995. Tempo: a declarative concurrent programming language. In Proceedings of the 12th International Logic Programming Conference (Tokyo, June 1995), L.#Sterling (Ed.). MIT Press.
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