Difference between revisions of "Algebra of Systems"
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
In [[Laws of programming]]<ref>{{:Paper/Laws of programming}}</ref>, Hoare et al. questioned whether a small set of algebraic laws can be directly useful in a practical engineering design problem. The absence of a tool that can bridge the cognitive gap between mathematical abstractions and engineering problems may have been the main reason for their conservative attitude. | In [[Laws of programming]]<ref>{{:Paper/Laws of programming}}</ref>, Hoare et al. questioned whether a small set of algebraic laws can be directly useful in a practical engineering design problem. The absence of a tool that can bridge the cognitive gap between mathematical abstractions and engineering problems may have been the main reason for their conservative attitude. | ||
The above statement echos who [[Dana Scott]]<ref>[https://youtu.be/8zk0yS8Jp5w?t=1300 Scott Commenting on a small algebra for combinators]</ref> was saying in the 2018 Lambda Conference. | The above statement echos who [[Dana Scott]]<ref>[https://youtu.be/8zk0yS8Jp5w?t=1300 Scott Commenting on a small algebra for combinators]</ref> was saying in the 2018 Lambda Conference. | ||
==A lookup table as a enumerable function== | |||
He said in this lecture<ref>[https://youtu.be/8zk0yS8Jp5w?t=1468 If the giant lookup table is enumerable ...]</ref>: | |||
If that lookup table is enumerable, that is a good indication of | |||
<noinclude> | <noinclude> | ||
Revision as of 04:58, 20 January 2022
Algebra of Systems[1] is a paper based on Koo's thesis[2].
A Concise Algebra for automating engineering tasks
This year 2009 paper summarized the following statement in the conclusion:
In Laws of programming[3], Hoare et al. questioned whether a small set of algebraic laws can be directly useful in a practical engineering design problem. The absence of a tool that can bridge the cognitive gap between mathematical abstractions and engineering problems may have been the main reason for their conservative attitude.
The above statement echos who Dana Scott[4] was saying in the 2018 Lambda Conference.
A lookup table as a enumerable function
He said in this lecture[5]:
If that lookup table is enumerable, that is a good indication of
References
- ↑ Koo, Hsueh-Yung Benjamin; Simmons, Willard; Crawley, Edward (Nov 16, 2021). "Algebra of Systems as a Meta Language for Model Synthesis and Analysis" (PDF). local page: IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS.
- ↑ Koo, Hsueh-Yung Benjamin (31 Jan 2005). A Meta-language for Systems Architecting (PDF) (Ph.D.). local page: MIT. Retrieved July 18, 2021.
- ↑ Hoare, C. A. R.; Hayes, I. J.; He, Jifeng; Morgan, C. C.; Roscoe, A. W.; Sanders, J. W.; Sorensen, I. H.; Spivey, J. M.; Sufrin, B. A. (Aug 1987). "Laws of Programming" (PDF). 30 (8). local page: ACM.
- ↑ Scott Commenting on a small algebra for combinators
- ↑ If the giant lookup table is enumerable ...