Article

Free access

Efficient reducibility between programming systems (Preliminary Report)

Authors:

Nancy A. Lynch,

Edward K. BlumAuthors Info & Claims

STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computing

Pages 228 - 238

https://doi.org/10.1145/800105.803413

Published: 04 May 1977 Publication History

Abstract

Much of the research on semantic theories has concentrated on qualitative properties such as definability (of such programming concepts as recursive procedures), equivalence (of different language constructs), and verifiability (of the correctness, or consistency, of one expression relative to another). Current qualitative theories are in a tentative state and much remains to be done. However, there is also a quantitative side to semantics. Indeed, many of the questions which any semantic theory must answer are at once qualitative and quantitative. We would like to draw upon complexity-theoretic techniques to answer such questions.

We are currently working on the development of new algebraic constructs to provide a mathematical framework for both qualitative and quantitative analysis of semantic problems.

References

[1]

C. C. Elgot, Monadic Computation and Iterative Algebraic Theories, IBM Report RC 4564, October 1973.

[2]

B. H. Liskov and S. N. Zilles, Specification Techniques for Data Abstractions, Software Engineering, Vol. SE-1, No. 1, March 1975, pp. 7-19.

[3]

F. L. Morris, Correctness of Translations of Programming Languages-An Algebraic Approach Stanford U. Report CS-72-303, Aug. 72.

[4]

R. M. Burstall, An Algebraic Description of Programs with Assertions, Verification and Simulation, in Proc. ACM Conference on Proving Assertions About Programs SIGPLAN Notices 7,1 ACM 72.

Digital Library

[5]

G. Birkhoff, The Role of Algebra in Computing, in Computers in Algebra and Number Theory, Vol iv SIAM-AMS Proc. A.M.S. 1971.

[6]

J. A. Goguen, J. W. Thatcher, E. G. Wagner and J. B. Wright, A Junction Between Computer Science and Category Theory: I Basic Concepts and Examples, Part 1, IBM Report RC-4526 (Sept. 73); Part 2, IBM Report RC-5908 (March 1976).

[7]

R. M. Burstall and J. W. Thatcher, The Algebraic Theory of Recursive Program Schemes, Symposium on Category Theory Applied to Computation and Control, Lecture Notes in Computer Science 25(1975), 126-131.

Digital Library

[8]

J. B. Wright, J. A. Goguen, J. W. Thatcher and E. G. Wagner, Rational Algebraic Theories and Fixed-Point Solutions Proc. 17th Annual Symposium on Foundations of Computer Science, (Oct. 76) 147-158.

Digital Library

[9]

J. V. Guttag, E. Horowitz and D. R. Musser, Abstract Data Types and Software Validation. Research Report 76-48. Information Sciences Institute, Aug. 1976.

[10]

A. V. Aho, J. E. Hopcroft and U. D. Ullman, The Design and Analysis of Computer Algorithms Addison-Wesley, 1974.

Digital Library

[11]

S. A. Cook, The Complexity of Theorem-Proving Procedures, Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.

Digital Library

[12]

R. Karp, Reducibility Among Combinatorial Problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds. Plenum Press (1972) pp. 85-104.

[13]

R. Ladner, N. A. Lynch and A. L. Selman, Comparison of Polynomial-Time Reducibilities, Sixth Annual ACM Symposium on Theory of Computing, 1974, pp. 110-121.

Digital Library

[14]

A. Borodin and I. Munro,

[15]

E. K. Blum and D. R. Estes, A Generalization of the Homomorphism Concept, Algebra Universalis, To appear.

[16]

M. S. Paterson and C. E. Hewitt, Comparative Schematology. Record of Project MAC Conference on Concurrent Systems and Parallel Computation (1970). pp. 119-128

[17]

D. C. Luckham, D. M. R. Park and M. S. Paterson, On Formalised Computer Programs, J.C.S.S., Vol. 4. No. 3, June 1970, 220-249.

[18]

Stephen J. Garland and David C. Luckham, Program Schemes, Recursion Schemes and Form Formal Languages, J.C.S.S., Vol. 7, No. 2 April 1973, 119-160.

[19]

Takumi Kasai, Translatability of Flowcharts into While Programs, J.C.S.S., Vol. 9, No. 2 October 1974, 177-195.

[20]

A. K. Chandra, Efficient Compilation of Linear Recursive Programs, Stanford Artificial Intelligence Project MEMO AIM-167, April 1972.

Digital Library

[21]

L. J. Stockmeyer, Arithmetic versus Boolean Operations in Idealized Register Machines, IBM RC 5954, (A 25 837).

Cited By

Hawrusik FVenkataraman KYasuhara A(1981)Classes of functions for computing on binary trees (Extended Abstract)Proceedings of the thirteenth annual ACM symposium on Theory of computing10.1145/800076.802453(19-27)Online publication date: 11-May-1981
https://dl.acm.org/doi/10.1145/800076.802453
Lynch NBlum E(1981)Relative complexity of algebrasMathematical Systems Theory10.1007/BF0175239614:1(193-214)Online publication date: Dec-1981
https://doi.org/10.1007/BF01752396
Lynch NBlum E(1979)Relative complexity of operations on numeric and bit-string algebrasMathematical Systems Theory10.1007/BF0174429513:1(187-207)Online publication date: Dec-1979
https://doi.org/10.1007/BF01744295
Show More Cited By

Index Terms

Efficient reducibility between programming systems (Preliminary Report)
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
      1. Logic programming and answer set programming
2. Theory of computation

Recommendations

Inaccessible worlds and irrelevance preliminary report
IJCAI'91: Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Recently, the relationship between several forms of default reasoning based on conditional defaults has been investigated, In particular, the systems based on e-semantics, preferential models and (fragments of) modally-defined conditional logics have ...
About agents that reason by case (preliminary report)
IRI'09: Proceedings of the 10th IEEE international conference on Information Reuse & Integration

This paper is concerned with intelligent agents that are able to perform nonmonotonic reasoning in the presence of various sources of information. More precisely, the focus is on default logic agents. It is well-known that default logic suffers from a ...
A Semantic Programming Language SPL+ - A Preliminary Report
ICTAI '08: Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 02

This paper is a preliminary report on the development of a "declarative" programming language SPL+. It assists non-technical people to write programs. The key idea behind SPL+ is that the "programmer" only needs to solve target problems with a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computing

May 1977

318 pages

ISBN:9781450374095

DOI:10.1145/800105

Copyright © 1977 ACM.

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 May 1977

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

STOC '77 Paper Acceptance Rate 31 of 87 submissions, 36%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
279
Total Downloads

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

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hawrusik FVenkataraman KYasuhara A(1981)Classes of functions for computing on binary trees (Extended Abstract)Proceedings of the thirteenth annual ACM symposium on Theory of computing10.1145/800076.802453(19-27)Online publication date: 11-May-1981
https://dl.acm.org/doi/10.1145/800076.802453
Lynch NBlum E(1981)Relative complexity of algebrasMathematical Systems Theory10.1007/BF0175239614:1(193-214)Online publication date: Dec-1981
https://doi.org/10.1007/BF01752396
Lynch NBlum E(1979)Relative complexity of operations on numeric and bit-string algebrasMathematical Systems Theory10.1007/BF0174429513:1(187-207)Online publication date: Dec-1979
https://doi.org/10.1007/BF01744295
Lynch NLipton RBurkhard WSavitch WFriedman EAho A(1978)Straight-line program length as a parameter for complexity measuresProceedings of the tenth annual ACM symposium on Theory of computing10.1145/800133.804343(150-161)Online publication date: 1-May-1978
https://dl.acm.org/doi/10.1145/800133.804343

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents