A FULLY ABSTRACT DENOTATIONAL MODEL FOR HIGHER-ORDER PROCESSES

被引：15
|
作者：
HENNESSY, M
机构：
[1] University of Sussex, Falmer
来源：
INFORMATION AND COMPUTATION | 1994年 / 112卷 / 01期
关键词：
D O I：
10.1006/inco.1994.1052
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A higher-order process calculus is defined in which one can describe processes which transmit as messages other processes; it may be viewed as a generalisation of the lazy lambda-calculus. We present a denotational model for the language, obtained by generalising the domain equation for Abramsky's model of the lazy lambda-calculus. It is shown to be fully abstract with respect to three different behavioural preorders. The first is based on observing the ability of processes to perform an action in all contexts, the second on testing, and the final one on satisfying certain kinds of modal formulae. (C) 1994 Academic Press, Inc.
引用
收藏
页码：55 / 95
页数：41
相关论文
共 50 条
  • [1] A fully abstract denotational semantics for the calculus of higher-order communicating systems
    Thomsen, B
    Abramsky, S
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 254 (1-2) : 557 - 589
  • [2] FULLY ABSTRACT SEMANTICS FOR HIGHER-ORDER COMMUNICATING SYSTEMS
    RAMESH, S
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 629 : 463 - 471
  • [3] A fully abstract denotational model for observational precongruence
    Ingolfsdottir, A
    Schalk, A
    [J]. COMPUTER SCIENCE LOGIC, 1996, 1092 : 335 - 361
  • [4] A fully abstract denotational model for observational precongruence
    Ingólfsdóttir, A
    Schalk, A
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 254 (1-2) : 35 - 61
  • [5] A denotational semantics of Simulink with higher-order UTP
    Xu, Xiong
    Zhan, Bohua
    Wang, Shuling
    Talpin, Jean-Pierre
    Zhan, Naijun
    [J]. JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2023, 130
  • [6] Denotational Validation of Higher-Order Bayesian Inference
    Scibior, Adam
    Kammar, Ohad
    Vakar, Matthijs
    Staton, Sam
    Yang, Hongseok
    Cai, Yufei
    Ostermann, Klaus
    Moss, Sean K.
    Heunen, Chris
    Ghahramani, Zoubin
    [J]. PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2018, 2
  • [7] A fully abstract semantics for a higher-order functional language with nondeterministic computation
    Jeffrey, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1999, 228 (1-2) : 105 - 150
  • [8] HIGHER-ORDER ABSTRACT SYNTAX
    PFENNING, F
    ELLIOTT, C
    [J]. SIGPLAN NOTICES, 1988, 23 (07): : 199 - 208
  • [9] A fully abstract denotational semantics for the π-calculus
    Hennessy, M
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 278 (1-2) : 53 - 89
  • [10] Focusing and higher-order abstract syntax
    Zeilberger, Noam
    [J]. ACM SIGPLAN NOTICES, 2008, 43 (01) : 359 - 369
12345