
doi: 10.1137/0208044
This paper considers the general problem of specifying the meaning of programming languages which include "data type definition facilities". The fundamental question posed in attempting to define such languages is: "what meaning should be given to a data type definition," or more simply, "what does data type mean?". In this paper we describe a new approach to defining the meaning of data types and give its application to the definition of a typed lambda calculus extension. We also prove a theorem stating that our language is "strongly typed".
Data structures, Semantics in the theory of computing, Combinatory logic and lambda calculus, General topics in the theory of software, data types, lambda calculus, semantics, polymorphism
Data structures, Semantics in the theory of computing, Combinatory logic and lambda calculus, General topics in the theory of software, data types, lambda calculus, semantics, polymorphism
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 27 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
