Yuichiro Ishii
Biographic Data
| ID | 3920288 |
|---|---|
| NAME | Yuichiro Ishii |
| GIVEN NAMES | Yuichiro |
| FAMILY NAME | Ishii |
| SIGNATURE | ISHII Y |
| VERIFIED | No |
| TOTAL WORKS | 3 |
| TOTAL CITATIONS | 6 |
| AUTHOR COUNT | 3 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2006 |
| LATEST PUBLICATION YEAR | 2008 |
| H-INDEX | 2 |
Sign and the lambda-term
We examine lambda calculus as a sign system and show that it explains important properties of language. First, we verify that a lambda-term has two essential functionalities of signs — articulation and naming — and argue that a lambda-term can thus be regarded as a sign model. Then, when signs are defined by self-reference, we show that these two functionalities become tightly coupled and that dyadic/triadic sign models become equivalent. Last, w…
Icon, index, symbol and denotation, connotation, metasign
We discuss how Hjelmslev's denotation, connotation, and metasign could correspond to Peirce's icon, index, and symbol. Our argument is based on the application of both theories to the programming language problem of confusion as to whether a sign signifies a value, reference, or type
Thirdness as self-reference in computing
We argue that the essence of thirdness in computing is self-reference. Our discussion is grounded on the theories of Church and Curry, which have been studied in the domain of theoretical computing. Using their theories, we show that any program can be transformed into a program consisting only of three-term relations, where the essence of the three-term relations lies in self-reference
Icon, index, symbol and denotation, connotation, metasign
We discuss how Hjelmslev's denotation, connotation, and metasign could correspond to Peirce's icon, index, and symbol. Our argument is based on the application of both theories to the programming language problem of confusion as to whether a sign signifies a value, reference, or type
Thirdness as self-reference in computing
We argue that the essence of thirdness in computing is self-reference. Our discussion is grounded on the theories of Church and Curry, which have been studied in the domain of theoretical computing. Using their theories, we show that any program can be transformed into a program consisting only of three-term relations, where the essence of the three-term relations lies in self-reference
Sign and the lambda-term
We examine lambda calculus as a sign system and show that it explains important properties of language. First, we verify that a lambda-term has two essential functionalities of signs — articulation and naming — and argue that a lambda-term can thus be regarded as a sign model. Then, when signs are defined by self-reference, we show that these two functionalities become tightly coupled and that dyadic/triadic sign models become equivalent. Last, w…
Thirdness as self-reference in computing
We argue that the essence of thirdness in computing is self-reference. Our discussion is grounded on the theories of Church and Curry, which have been studied in the domain of theoretical computing. Using their theories, we show that any program can be transformed into a program consisting only of three-term relations, where the essence of the three-term relations lies in self-reference
Icon, index, symbol and denotation, connotation, metasign
We discuss how Hjelmslev's denotation, connotation, and metasign could correspond to Peirce's icon, index, and symbol. Our argument is based on the application of both theories to the programming language problem of confusion as to whether a sign signifies a value, reference, or type
Sign and the lambda-term
We examine lambda calculus as a sign system and show that it explains important properties of language. First, we verify that a lambda-term has two essential functionalities of signs — articulation and naming — and argue that a lambda-term can thus be regarded as a sign model. Then, when signs are defined by self-reference, we show that these two functionalities become tightly coupled and that dyadic/triadic sign models become equivalent. Last, w…
Mathematics (3 works) · Computer Science (2 works) · Logic, programming, and type systems (2 works) · Philosophy (2 works) · Programming language (2 works) · Sign (mathematics) (2 works) · Term (time) (2 works) · Argument (complex analysis) (1 works) · Calculus (dental) (1 works) · Computability, Logic, AI Algorithms (1 works)