Games for complexity of second-order call-by-name programs
<p>We use game semantics to show that program equivalence and program approximation in a second-order fragment of Idealized Algol are PSPACE-complete. The result relies on a PSPACE construction of deterministic finite automata representing strategies defined by second-order programs and is an...
| Hoofdauteur: | |
|---|---|
| Formaat: | Journal article |
| Taal: | English |
| Gepubliceerd in: |
Elsevier
2005
|
| Onderwerpen: |