Orthogonal higher-order rewrite systems are confluent

Tobias Nipkow

doi:10.1007/bfb0037114

Orthogonal higher-order rewrite systems are confluent

Tobias Nipkow

Informatik 7 - Lehrstuhl für Theoretische Informatik

Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

28 Zitate (Scopus)

Originalsprache	Englisch
Titel	Typed Lambda Calculi and Applications - International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Proceedings
Redakteure/-innen	Marc Bezem, Jan Friso Groote
Herausgeber (Verlag)	Springer Verlag
Seiten	306-317
Seitenumfang	12
ISBN (Print)	9783540565178
DOIs	https://doi.org/10.1007/bfb0037114
Publikationsstatus	Veröffentlicht - 1993
Veranstaltung	1st International Conference on Typed Lamda Calculi and Applications, TLCA 1993 - Utrecht, Niederlande Dauer: 16 März 1993 → 18 März 1993

Publikationsreihe

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band	664 LNCS
ISSN (Print)	0302-9743
ISSN (elektronisch)	1611-3349

Konferenz

Konferenz	1st International Conference on Typed Lamda Calculi and Applications, TLCA 1993
Land/Gebiet	Niederlande
Ort	Utrecht
Zeitraum	16/03/93 → 18/03/93

Zugriff auf Dokument

10.1007/bfb0037114

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Dieses zitieren

Nipkow, T. (1993). Orthogonal higher-order rewrite systems are confluent. in M. Bezem, & J. F. Groote (Hrsg.), Typed Lambda Calculi and Applications - International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Proceedings (S. 306-317). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 664 LNCS). Springer Verlag. https://doi.org/10.1007/bfb0037114

Nipkow, Tobias. / Orthogonal higher-order rewrite systems are confluent. Typed Lambda Calculi and Applications - International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Proceedings. Hrsg. / Marc Bezem ; Jan Friso Groote. Springer Verlag, 1993. S. 306-317 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{11f92ef52d1f4307a275188084d9a177,

title = "Orthogonal higher-order rewrite systems are confluent",

author = "Tobias Nipkow",

year = "1993",

doi = "10.1007/bfb0037114",

language = "English",

isbn = "9783540565178",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "306--317",

editor = "Marc Bezem and Groote, {Jan Friso}",

booktitle = "Typed Lambda Calculi and Applications - International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Proceedings",

note = "1st International Conference on Typed Lamda Calculi and Applications, TLCA 1993 ; Conference date: 16-03-1993 Through 18-03-1993",

}

Nipkow, T 1993, Orthogonal higher-order rewrite systems are confluent. in M Bezem & JF Groote (Hrsg.), Typed Lambda Calculi and Applications - International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 664 LNCS, Springer Verlag, S. 306-317, 1st International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Utrecht, Niederlande, 16/03/93. https://doi.org/10.1007/bfb0037114

Orthogonal higher-order rewrite systems are confluent. / Nipkow, Tobias.
Typed Lambda Calculi and Applications - International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Proceedings. Hrsg. / Marc Bezem; Jan Friso Groote. Springer Verlag, 1993. S. 306-317 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 664 LNCS).

Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

TY - GEN

T1 - Orthogonal higher-order rewrite systems are confluent

AU - Nipkow, Tobias

PY - 1993

Y1 - 1993

UR - http://www.scopus.com/inward/record.url?scp=84958746627&partnerID=8YFLogxK

U2 - 10.1007/bfb0037114

DO - 10.1007/bfb0037114

M3 - Conference contribution

AN - SCOPUS:84958746627

SN - 9783540565178

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 306

EP - 317

BT - Typed Lambda Calculi and Applications - International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Proceedings

A2 - Bezem, Marc

A2 - Groote, Jan Friso

PB - Springer Verlag

T2 - 1st International Conference on Typed Lamda Calculi and Applications, TLCA 1993

Y2 - 16 March 1993 through 18 March 1993

ER -

Nipkow T. Orthogonal higher-order rewrite systems are confluent. in Bezem M, Groote JF, Hrsg., Typed Lambda Calculi and Applications - International Conference on Typed Lamda Calculi and Applications, TLCA 1993, Proceedings. Springer Verlag. 1993. S. 306-317. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/bfb0037114