(Enter summary)
Abstract: This paper introduces new-HOPLA, a concise but powerful language for higher-order
nondeterministic processes with name generation. Its origins as a metalanguage for domain
theory are sketched but for the most part the paper concentrates on its operational semantics. (Update)
Context of citations to this paper: More
.... have been proposed for evaluating recursive queries expressed using sets of Horn Clauses (rules) Henschen and Naqvi 84] Kifer and Lozinskii 85] Lozinskii 85] McKay and Shapiro 81] Rohmer and Lescoeur 85] Sacca and Zaniolo 86a] Van Gelder 86] Vieille 86]...
Cited by: More
XQuery Query Processing in Relational Systems - Chen (2004)
(Correct)
On the Power of Magic - Beeri, Ramakrishnan (1987)
(Correct)
Active bibliography (related documents): More All
1.6: Basic Research in Computer Science - New-Hopla Higher-Order Process
(Correct)
0.3: Domain Theory for Concurrency - Nygaard (2003)
(Correct)
0.1: Models for Name-Passing Processes: Interleaving and Causal.. - Cattani, Sewell (2000)
(Correct)
Similar documents based on text: More All
0.3: Bisimulation Proof Methods for Mobile Ambients - Merro, Nardelli (2003)
(Correct)
0.2: Typing mobility in the Seal Calculus - Giuseppe Castagna Giorgio (2001)
(Correct)
0.2: A Compositional Proof System for the Modal µ-Calculus - Andersen, Stirling, Winskel (1994)
(Correct)
BibTeX entry: (Update)
"Query Optimization in Logic Databases," M. Kifer and E. Lozinskii, Technical Report, SUNY at Stonybrook, June 1985. http://citeseer.ist.psu.edu/664755.html More
@misc{ in85technical,
author = "Q. in and L. Databases and M. Kifer and E. Lozinskii",
title = "Technical Report",
text = "Query Optimization in Logic Databases, M. Kifer and E. Lozinskii, Technical
Report, SUNY at Stonybrook, June 1985.",
year = "1985",
url = "citeseer.ist.psu.edu/664755.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard - 1987 ACM
112
Bisimilarity as a theory of functional programming: mini-cou.. (context) - Gordon - 1995
81
calculus: a Theory of Mobile Processes (context) - Sangiorgi, Walker - 2001
75
Proving congruence of bisimulation in functional programming..
- Howe - 1996 ACM DBLP
52
Towards a lambda calculus for concurrent and communicating s.. (context) - Boudol - 1989
48
Operationally-based theories of program equivalence
- Pitts - 1997
46
Calculi for Higher Order Communicating Systems (context) - Thomsen - 1990
38
A metalanguage for programming with bound names modulo renam..
- Pitts, Gabbay - 2000 ACM DBLP
20
A fully-abstract domain model for the #-calculus (context) - Stark - 1996
17
Presheaf models for the #-calculus
- Cattani, Stark et al. - 1997
17
A fully-abstract model for the #-calculus (context) - Fiore, Moggi et al. - 1996
7
Hopla---a higher-order process language
- Nygaard, Winskel - 2002
6
Full abstraction for HOPLA
- Nygaard, Winskel - 2003 DBLP
2
To appear in Theoretical Computer Science (context) - Nygaard, Winskel et al. - 2003
2
De la semantique des processus d'ordre superieur (context) - Nardelli - 2003
Documents on the same site (http://www.di.ens.fr/~zappa/): More
Types for Seal Calculus - Nardelli
(Correct)
Typing mobility in the Seal Calculus - Giuseppe Castagna Giorgio (2001)
(Correct)
Bisimulation Proof Methods for Mobile Ambients - Merro, Nardelli (2003)
(Correct)
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