Semantics of under-determined expressions-Reference-Cited by-同舟云学术

Semantics of under-determined expressions

Published:1996-01 Issue:1 Volume:8 Page:47-66
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Larsen Peter Gorm¹,Hansen Bo Stig²

Affiliation:

1. IFAD, The Institute of Applied Computer Science, Forskerparken 10, DK-5230, Odense M, Denmark

2. Department of Computer Science, Technical University of Denmark, Lyngby, Denmark

Abstract

Abstract Some specification languages, such as VDM-SL, allow expressions whose values are not fully determined. This may be convenient in cases where the choice of value should be left to a later stage of development. We consider a simple functional language including such under-determined expressions and present a denotational semantics for the language along with a set of proof rules for reasoning about properties of under-determined expressions. One of the specific problems considered is the combination of under-determinedness and a least fixed point semantics of recursion. Soundness of the proof rules is also discussed.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01211050.pdf

Reference18 articles.

1. Do-it-yourself type theory

2. Bicarregui J. Fitzgerald J.S. Lindsay P. Moore R. and Ritchie B.: Proof in VDM: A Practitioner's Guide. Springer-Verlag 1994.

3. Broy M.: A fixed point approach to applicative multiprogramming. In M. Broy and G. Schmidt editors Theoretical Foundations of Programming Methodology pages 565–622. Reidel 1982.

4. British Standards Institution. Z base standard November 1992. Version 1.0.

5. The RAISE Language Group.: The RAISE Specification Language . Prentice-Hall 1992.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dually nondeterministic functions;ACM Transactions on Programming Languages and Systems;2008-10

2. Vienna Development Method;Wiley Encyclopedia of Computer Science and Engineering;2008-09-15

3. Modelling higher-order dual nondeterminacy;Acta Informatica;2008-06-21

4. The Typed Logic of Partial Functions and the Vienna Development Method;Logics of Specification Languages;2007-12-05

5. Reasoning About Partial Functions in the Formal Development of Programs;Electronic Notes in Theoretical Computer Science;2006-01