Article

Free access

On the decision problems of program schemas with commutative and invertible functions

Author:

Ashok K. ChandraAuthors Info & Claims

POPL '73: Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Pages 235 - 242

https://doi.org/10.1145/512927.512949

Published: 01 October 1973 Publication History

PDF eReader

Abstract

We consider partially interpreted monadic schemas in which some functions are specified to commute, or some function is specified to be invertible. The decision problems considered are those of halting, divergence, equivalence, inclusion and isomorphism. It is shown that with either commutativity or invertibility alone, all these decision problems are solvable, whereas with both commutativity and invertibility, all become unsolvable. These results are also related to the decision problems for finite automata on multi-dimensional infinite tapes.

References

[1]

Ashcroft, Manna and Pnueli {1973}. E. Ashcroft, Z. Manna and A. Pnueli, "Decidable properties of monadic functional schemas," Journal of the ACM, Vol. 20, No. 2 (April 1973).

Digital Library

Google Scholar

[2]

Chandra {1973}. A. K. Chandra, "On the properties and applications of program schemas," Ph.D. Thesis, Report no. CS-336, AIM-188, Computer Science Dept., Stanford University, March 1973.

Digital Library

Google Scholar

[3]

Chandra and Manna {1973}. A. K. Chandra and Z. Manna, "On the power of programming features," Report no. CS-333, AIM-185, Computer Science Dept., Stanford University, January 1973.

Digital Library

Google Scholar

[4]

Constable and Gries {1972}. R. L. Constable and D. Gries, "On classes of program schemata," in SIAM Journal on Computing, Vol. 1, No. 1, March 1972, pp. 66-118.

Crossref

Google Scholar

[5]

Garland and Luckham {1971}. S. J. Garland and D. C. Luckham, "Program schemes, recursion schemes, and formal languages," UCLA report no. ENG-7154, June 1971.

Google Scholar

[6]

Ianov {1958}. Iu Ianov, "The logical schemas of algorithms, "Problems and Cybernetics, Vol. 1, pp. 75-127, (Russian edition).

Google Scholar

[7]

Ianov {1960}. Iu Ianov, "The logical schemes of algorithms," English translation in Problems of Cybernetics, Vol. 1, Pergamon Press, New York, 1960, pp. 82-140.

Google Scholar

[8]

Luckham, Park and Paterson {1970}. D. C. Luckham, D. M. R. Park and M. S. Paterson, "On formalized computer programs," Journal of Computer and System Sciences, Vol. 4, No. 3, (June 1970) pp. 220-249.

Digital Library

Google Scholar

[9]

Manna {1969}. Z. Manna, "Properties of programs and the first-order predicate calculus," Journal of the ACM, Vol. 16, No. 2, April 1969 pp. 244-255.

Digital Library

Google Scholar

[10]

Paterson {1967}. M. S. Paterson, "Equivalence problems in a model of computation," Ph.D. Thesis, University of Cambridge, England (August 1967). Also Artificial Intelligence Memo, No. 1, Mass. Institute of Technology, 1970.

Google Scholar

[11]

Paterson and Hewitt {1970}. M. S. Paterson and C. E. Hewitt, "Comparative schematology," in Record of Project MAC Conference on concurrent systems and parallel computation, ACM, New York (December 1970), pp. 119-128.

Google Scholar

Cited By

View all

Danicic SHarman MHierons RHowroyd JLaurence M(2007)Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial timeTheoretical Computer Science10.1016/j.tcs.2006.10.001373:1-2(1-18)Online publication date: 10-Mar-2007
https://dl.acm.org/doi/10.1016/j.tcs.2006.10.001
Tokura NKasami TFuruta S(1974)Ianov schemas augmented by a pushdown memoryProceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)10.1109/SWAT.1974.12(84-94)Online publication date: 14-Oct-1974
https://dl.acm.org/doi/10.1109/SWAT.1974.12

On the decision problems of program schemas with commutative and invertible functions
1. Theory of computation
  1. Models of computation

Recommendations

Commutative pseudo-equality algebras

Pseudo-equality algebras were initially introduced by Jenei and Kóródi as a possible algebraic semantic for fuzzy-type theory, and they have been revised by Dvureăźenskij and Zahiri under the name of JK-algebras. In this paper, we define and study the ...
Combination problems for commutative/monoidal theories or how algebra can help in equational unification

We study the class of theories for which solving unification problems is equivalent to solving systems of linear equations over a semiring. It encompasses important examples like the theories of Abelian monoids, idempotent Abelian monoids, and Abelian ...
A non-commutative and non-idempotent theory of quantale sets

In fuzzy set theory non-idempotency arises when the conjunction is interpreted by arbitrary t-norms. There are many instances in mathematics where set theory ought to be non-commutative and/or non-idempotent. The purpose of this paper is to combine both ...

Comments

Information & Contributors

Information

Published In

POPL '73: Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages

October 1973

242 pages

ISBN:9781450373494

DOI:10.1145/512927

Conference Chair:
Patrick C. Fischer
University of Waterloo, Waterloo, Ontario, Canada
,
Program Chair:
Jeffrey D. Ullman
Princeton University, Princeton, NJ 08540

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1973

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

POPL '73 Paper Acceptance Rate 22 of 100 submissions, 22%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
232
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)4

Reflects downloads up to 21 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Danicic SHarman MHierons RHowroyd JLaurence M(2007)Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial timeTheoretical Computer Science10.1016/j.tcs.2006.10.001373:1-2(1-18)Online publication date: 10-Mar-2007
https://dl.acm.org/doi/10.1016/j.tcs.2006.10.001
Tokura NKasami TFuruta S(1974)Ianov schemas augmented by a pushdown memoryProceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)10.1109/SWAT.1974.12(84-94)Online publication date: 14-Oct-1974
https://dl.acm.org/doi/10.1109/SWAT.1974.12

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Commutative pseudo-equality algebras

Combination problems for commutative/monoidal theories or how algebra can help in equational unification

A non-commutative and non-idempotent theory of quantale sets

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Recommendations

Commutative pseudo-equality algebras

Combination problems for commutative/monoidal theories or how algebra can help in equational unification

A non-commutative and non-idempotent theory of quantale sets

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations