New-HOPLA A Higher-Order Process Language with Name Generation Glynn Winskel...  Home/Search
Context
Related
| brics.dk/RS/04/Ref...ICSRS0421.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/RS/04/...BRICSRS04Ref (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper introduces new-HOPLA, a concise but powerful language for higherorder 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. The language is typed, the type of a process describing the shape of the computation paths it can perform. Its transition semantics, bisimulation, congruence properties and expressive power are explored. Encodings are given of... (Update)
Active bibliography (related documents): More All
1.6: Technical Report - Number Ucam-Cl-Tr- Issn (1985) (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.2: A Compositional Proof System for the Modal µ-Calculus - Andersen, Stirling, Winskel (1998) (Correct)
0.2: Bisimulation Proof Methods for Mobile Ambients - Universita (2003) (Correct)
0.2: Typing mobility in the Seal Calculus - Giuseppe Castagna Giorgio (2001) (Correct)
BibTeX entry: (Update)
@misc{ process-basic,
author = "New-Hopla Higher-Order Process",
title = "Basic Research in Computer Science",
url = "citeseer.ist.psu.edu/732449.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987
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
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
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
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.brics.dk/RS/04/Ref/BRICS-RS-04-Ref/BRICS-RS-04-Ref.html): More
Congruences for Contextual Graph-Rewriting - Sassone, Sobocinski (2004) (Correct)
The Design Space of Type Checkers for XML Transformation.. - Møller, Schwartzbach (2004) (Correct)
Split-2 Bisimilarity has a Finite Axiomatization over CCS with.. - Aceto, al. (2004) (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