Structured program theorem: Difference between revisions

Revision as of 15:00, 12 July 2025

Revision as of 15:08, 12 July 2025

Line 145:

==Further reading==

Material not yet covered above:

* {{cite journal | doi = 10.1145/322169.322180 | title=Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem | journal=Journal of the ACM | date=1980 | volume=27 | issue=1 | pages=123–127 | first=Richard A. | last=DeMillo| s2cid=15669719 | doi-access=free }}

* {{cite journal

* {{cite book | doi = 10.1007/3-540-57785-8_128 | chapter=One binary horn clause is enough | volume=775 | date=1994 | pages=19–32 | first=Philippe | last=Devienne| title=Stacs 94 | series=Lecture Notes in Computer Science | isbn=978-3-540-57785-0 | citeseerx=10.1.1.14.537 }}

|last1=DeMillo

|first1=Richard A.

|author1-link=Richard DeMillo

|last2=Eisenstat

|first2=Stanley C.

|last3=Lipton

|first3=Richard J.

|title=Space‑Time Trade‑Offs in Structured Programming: An Improved Combinatorial Embedding Theorem

|journal=[[Journal of the ACM]]

|volume=27

|issue=1

|pages=123–127

|date=January 1980

|doi=10.1145/322169.322180

|s2cid=15669719

| doi-access=free

}}

* {{cite conference

|last1=Devienne |first1=Philippe

|last2=Lebègue |first2=Patrick

|last3=Routier |first3=Jean-Christophe

|last4=Würtz |first4=Jörg

|title=One binary Horn clause is enough

|book-title=Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science (STACS ’94)

|series=Lecture Notes in Computer Science

|volume=775

|pages=21–32

|date=February 1994

|doi=10.1007/3-540-57785-8_128

|isbn=978-3-540-57785-0

|citeseerx=10.1.1.14.537

}}

[[Category:Programming language theory]]