Filters








134 Hits in 2.4 sec

Angelic Nondeterminism and Unifying Theories of Programming

Ana Cavalcanti, Jim Woodcock
2005 Electronical Notes in Theoretical Computer Science  
Hoare and He's unifying theories of programming (UTP) is a model of alphabetised relations expressed as predicates, which supports development in several programming paradigms.  ...  model and can express angelic and demonic nondeterminism.  ...  Unifying theories of programming The objective of Hoare and He's unifying theories of programming is to study and compare programming paradigms.  ... 
doi:10.1016/j.entcs.2005.04.024 fatcat:hyht2t4rd5fgdmnzskpbrgagja

Angelic nondeterminism in the unifying theories of programming

Ana Cavalcanti, Jim Woodcock, Steve Dunne
2006 Formal Aspects of Computing  
Hoare and He's unifying theories of programming (UTP) is a model of alphabetised relations expressed as predicates; it supports development in several programming paradigms.  ...  model and can express angelic and demonic nondeterminism.  ...  This work is partially funded by QinetiQ and the Royal Society.  ... 
doi:10.1007/s00165-006-0001-8 fatcat:lnybsg5qofd4fpiz4iveasdrwe

An Approach to Nondeterminism in Translation of CZ Set Theory into Martin-Löf 's Theory of Types

Hassan Haghighi, Seyyed Hassan Mirian Hosseinabadi
2006 Electronical Notes in Theoretical Computer Science  
Keywords: formal program development, nondeterminism in CZ language, nondeterminism in Martin-Löf's theory of types, translation of CZ set theory into Martin-Löf's theory of types 1  ...  Therefore, support for nondeterminism should be provisioned in developing programs from their formal specifications.  ...  Hence, aborting of a program can be seen as a certain property to distinguish demonic and angelic nondeterminism.  ... 
doi:10.1016/j.entcs.2005.12.065 fatcat:cb2ufjp5yjcaxmjecmxmid43jy

UTP and Sustainability [chapter]

Yifeng Chen, Jeff W. Sanders
2010 Lecture Notes in Computer Science  
Abstract Hoare and He's approach to unifying theories of programming, UTP, is a dozen years old. In spite of the importance of its ideas, UTP does not seem to be attracting due interest.  ...  UNU-IIST is jointly funded by the government of Macao and the governments of the People's Republic of China and Portugal through a contribution to the UNU Endowment Fund.  ...  We shall not cease from exploration And the end of all our exploring Will be to arrive where we started And know the place for the first time. Little Gidding [10]  ... 
doi:10.1007/978-3-642-16690-7_2 fatcat:2rls3o2y7fhwjdueirysdh4nvy

Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular

Aliaume Lopez, Alex Simpson, Michael Wagner
2018 Annual Conference for Computer Science Logic  
We do this in the case of both angelic and demonic nondeterminism.  ...  We propose three general approaches to specifying such preorders: (i) operational (ii) denotational, and (iii) axiomatic; coinciding with the three major styles of program semantics.  ...  Acknowledgements We thank Gordon Plotkin, Matija Pretnar and Niels Voorneveld for helpful discussions.  ... 
doi:10.4230/lipics.csl.2018.29 dblp:conf/csl/LopezS18 fatcat:wins7aui3bgvbkkwwv3hpp4z3e

Relational algebraic semantics of deterministic and nondeterministic programs

R. Berghammer, H. Zierer
1986 Theoretical Computer Science  
Then, the deterministic language DFP is extended to a nondeterministic functional language NFP in order to investigate three kinds of nondeterminism, viz. erratic, angelic, and demonic nondeterminism.  ...  The uniform description of domains and programs makes it possible to prove the termination of 'concrete' deterministic and nondeterministic programs by induction.  ...  Acknowledgment We gratefully acknowledge a number of valuable discussions with G. Schmidt and W. Dosch. We thank H. Ehler for carefully reading a draft version of this paper.  ... 
doi:10.1016/0304-3975(86)90172-6 fatcat:5usl5zgmevdkxegrzond5na7oa

Algebraic approaches to nondeterminism---an overview

Michał Walicki, Sigurd Meldal
1997 ACM Computing Surveys  
The programming languages CN, BN, AN, and LN are specified which include, respectively, erratic, demonic, angelic, and loose nondeterminism (which, roughly, reflects the idea of a specification with loose  ...  If is fair (in this case it means also angelic), then the program will always terminate.  ... 
doi:10.1145/248621.248623 fatcat:5o2gkoijefg7dgznddcqefpkbi

Unifying Probability with Nondeterminism [chapter]

Yifeng Chen, J. W. Sanders
2009 Lecture Notes in Computer Science  
UNU-IIST is jointly funded by the government of Macao and the governments of the People's Republic of China and Portugal through a contribution to the UNU Endowment Fund.  ...  They are records of UNU-IIST activities and research and development achievements. Many of the reports are also published in conference proceedings and journals. Please write to UNU-IIST at P.O.  ...  One successful method for adding complexity incrementally has been suggested by Hoare and He in the 'Unifying Theories of Programming' (UTP) approach [7, 4] to program semantics.  ... 
doi:10.1007/978-3-642-05089-3_30 fatcat:vu64y4p6avhsvepdje7nqhknh4

Page 3227 of Mathematical Reviews Vol. , Issue 86g [page]

1986 Mathematical Reviews  
From the introduction: “We show in the present paper that func- tional programming and logical programming can be unified within the framework of functional programming.  ...  These automata are equivalent to endomorphisms of a com- pact abelian group. The statistical and dynamical properties are obtained by Fourier analysis and ergodic theory.  ... 

Unifying Theories of Programming with Monads [chapter]

Jeremy Gibbons
2013 Lecture Notes in Computer Science  
The combination of probabilistic and nondeterministic choice in program calculi is a notoriously tricky problem, and one with a long history.  ...  We present a simple functional programming approach to this challenge, based on algebraic theories of computational effects.  ...  Acknowledgements We are grateful to members of the Algebra of Programming research group at Oxford and of IFIP Working Groups 2.1 and 2.8, and to the referees of this and the earlier paper [10] , all  ... 
doi:10.1007/978-3-642-35705-3_2 fatcat:n6m6xbztxzbb7jbhrharebjdnu

Designs with Angelic Nondeterminism

Pedro Ribeiro, Ana Cavalcanti
2013 2013 International Symposium on Theoretical Aspects of Software Engineering  
The Unifying Theories of Programming (UTP) of Hoare and He is a predicative framework of relations suitable for the rigorous study of different programming paradigms.  ...  Previous work has proposed a theory of angelic nondeterminism in the UTP through a predicative model of binary multirelations. Such models, however, can only model terminating programs.  ...  Demonic and angelic nondeterminism In this section we explore the two types of nondeterminism operators supported by the theory: angelic and demonic choice.  ... 
doi:10.1109/tase.2013.18 dblp:conf/tase/RibeiroC13 fatcat:dq35raedvfband47q7sjcejdmm

Supporting ArcAngel in ProofPower

Frank Zeyda, Marcel Oliveira, Ana Cavalcanti
2009 Electronical Notes in Theoretical Computer Science  
ArcAngel supports backtracking through angelic choice; this is beyond the basic capabilities of ProofPower and many other main-stream theorem provers.  ...  It is especially well-suited for the specification of high-level strategies to derive programs by construction, and equipped with a formal semantics that enables reasoning about tactics.  ...  INES and CNPq partially supports the work of Marcel Oliveira: grants 550946/2007-1, 620132/2008-6, and 573964/2008-4.  ... 
doi:10.1016/j.entcs.2009.12.027 fatcat:ezegpcrnubfhhln4r2hrgxcaca

Page 6840 of Mathematical Reviews Vol. , Issue 91M [page]

1991 Mathematical Reviews  
Finally, a general specifi- cation language with duality in a strong sense, permitting both “demonic” andangelicnondeterminism, with strict and mirac- ulous statements, is defined, and it is shown  ...  Systems Theory 23 (1990), no. 4, 245-254.  ... 

Healthiness from Duality

Wataru Hino, Hiroki Kobayashi, Ichiro Hasuo, Bart Jacobs
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
The latter notion seems interesting in its own right in the context of monads, Lawvere theories and enriched categories. Theorem 1.1 (healthiness under the "may"-nondeterminism). 1.  ...  It asks for an intrinsic characterization of those predicate transformers which arise as the (backward) interpretation of a certain class of programs.  ...  Special thanks are due to John Power for the lectures he gave on the occasion of his visit to Tokyo; the notion of relative algebra is inspired by them.  ... 
doi:10.1145/2933575.2935319 dblp:conf/lics/HinoKH016 fatcat:odnri772tnhkpfcneqj23idskq

Page 1303 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
1303 68Q Theory of computing “More specifically, we study the complexity of detecting copy constants in parallel programs, a problem that may be seen as rep- resenting the next level of difficulty of data-flow  ...  In particular, they consider Sipser’s CD complexity, where CD'(x) is the size of a smallest program that distinguishes x from all other strings in time ¢(|x|), and its nondeterministic variant CND.  ... 
« Previous Showing results 1 — 15 out of 134 results