Language and metalanguage

Most high-level programming languages do not have the ability to control the bindings between internal names and external implementations of those names at run time.This facility is necessary for the use of the language in a monolingual progrAmm~ng environment. The paper describes the semantics of a "dynamic binding" feature for a block-structured, strongly typed language that supports such control and presents an experimental implementation of Pascal that contains dynamic binding.

show abstract

“…Algol 68 [vanWijngaarden76] allows strongly typed dynamic binding within the confines of a single program.…”

confidence: 99%

Dynamic binding of separately compiled objects under program control

Gantenbein

Jones

1986

Proceedings of the 1986 ACM Fourteenth Annual Conference on Computer Science - CSC '86

View full text Add to dashboard Cite

show abstract

“…The computational rules in 4.2 can be converted into a straightforward and practical algorithm, based on the method of trails [28]. To reflect more closely actual implementations, we adopt the additional rules (assmp' A ), (µ lA ), and (µ rA ) described in 4.2.…”

Section: An Implementationmentioning

confidence: 99%

Subtyping recursive types

Amadio

Cardelli²

1993

ACM Trans. Program. Lang. Syst.

284

102

View full text Add to dashboard Cite

We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the subtype relation, and whether a term has a type.To address the first question, we relate various definitions of type equivalence and subtyping that are induced by a model, an ordering on infinite trees, an algorithm, and a set of type rules. We show soundness and completeness between the rules, the algorithm, and the tree semantics. We also prove soundness and a restricted form of completeness for the model.To address the second question, we show that to every pair of types in the subtype relation we can associate a term whose denotation is the uniquely determined coercion map between the two types. Moreover, we derive an algorithm that, when given a term with implicit coercions, can infer its least type whenever possible.

show abstract