Fundamental Concepts in Programming Languages
By Christopher S. Strachey. High. Order Symb. Comput., 2000
368 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/27b9bc593f3de3170bbd484b2b8465677ed5bff1
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Alexandre Passos
- Sorin Lerner
- Akshay Agrawal
- Ashish Agarwal
- Igor Ganichev
- Zachary Tatlock
- Ivan A. Sag
- Michael Stepp
In Computational Theory and Mathematics
- Alexandre Passos
- Sorin Lerner
- Akshay Agrawal
- Ashish Agarwal
- Zachary Tatlock
- Ivan A. Sag
- Michael Stepp
- Friedrich Steimann
Citations in the corpus
- Equality saturation: a new approach to optimization (2009, background): “The key feature of PEGs that makes our equalitysaturation approach effective is that they are referentially transparent, which intuitively means that the value of an expression depends only on the values of its constituent expressions [50, 36, 46].”
- On the representation of roles in object-oriented and conceptual modelling (2000, background): “Strachey, who introduced the term to the computing field [68], made a distinction between what he called ad hoc polymorphism and parametric polymorphism.”
- TensorFlow Eager: A Multi-Stage, Python-Embedded DSL for Machine Learning (2019, background): “In this sense, function provides ad hoc polymorphism (Strachey, 2000) or function overloading.”
- Sign-Based Construction Grammar: An Informal Synopsis (2012, background): “A FS of this sort can be regarded as a particular kind of function called an ' ad - hoc polymorphism ' ( Strachey 1967 ) .”