Algebras of general non-deterministic predicates
Logics of general nondeterministic qua-siary predicates, called GND-predicates, are defined and investigated. These logics are program-oriented logical for-malisms that reflect such properties of programs as partiality, nondeterminism, and non-fixed arity. GND-predicates generalize partial predicate...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
PROBLEMS IN PROGRAMMING
2018
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/227 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: |  |
Institution
Problems in programmingBe the first to leave a comment!