On the ambiguation of Polish notation

Albert Visser

doi:10.1016/j.tcs.2011.01.025

On the ambiguation of Polish notation

Albert Visser^*

^*Corresponding author for this work

OFR - Theoretical Philosophy

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

In this paper we study an alternative way of treating Polish notation. Instead of proving unique reading for a well-behaved set of terms, we interpret any string of the alphabet in a monoid that extends, in a specifiable sense, the given algebra of functions.

Original language	English
Pages (from-to)	3404-3411
Number of pages	8
Journal	Theoretical Computer Science
Volume	412
Issue number	28
DOIs	https://doi.org/10.1016/j.tcs.2011.01.025
Publication status	Published - 20 Jun 2011

Keywords

Algebra
Monoid
Polish notation
Pushout
Unique reading

Access to Document

10.1016/j.tcs.2011.01.025

Cite this

@article{8633953635674bbd99f40d4f3cac17b4,

title = "On the ambiguation of Polish notation",

abstract = "In this paper we study an alternative way of treating Polish notation. Instead of proving unique reading for a well-behaved set of terms, we interpret any string of the alphabet in a monoid that extends, in a specifiable sense, the given algebra of functions.",

keywords = "Algebra, Monoid, Polish notation, Pushout, Unique reading",

author = "Albert Visser",

year = "2011",

month = jun,

day = "20",

doi = "10.1016/j.tcs.2011.01.025",

language = "English",

volume = "412",

pages = "3404--3411",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier BV",

number = "28",

}

TY - JOUR

T1 - On the ambiguation of Polish notation

AU - Visser, Albert

PY - 2011/6/20

Y1 - 2011/6/20

N2 - In this paper we study an alternative way of treating Polish notation. Instead of proving unique reading for a well-behaved set of terms, we interpret any string of the alphabet in a monoid that extends, in a specifiable sense, the given algebra of functions.

AB - In this paper we study an alternative way of treating Polish notation. Instead of proving unique reading for a well-behaved set of terms, we interpret any string of the alphabet in a monoid that extends, in a specifiable sense, the given algebra of functions.

KW - Algebra

KW - Monoid

KW - Polish notation

KW - Pushout

KW - Unique reading

UR - https://www.scopus.com/pages/publications/79959718208

U2 - 10.1016/j.tcs.2011.01.025

DO - 10.1016/j.tcs.2011.01.025

M3 - Article

AN - SCOPUS:79959718208

SN - 0304-3975

VL - 412

SP - 3404

EP - 3411

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 28

ER -

On the ambiguation of Polish notation

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this