Type inference for polymorphic references

Tofte, Mads

doi:10.1016/0890-5401(90)90018-d

Cited by 148 publications

(132 citation statements)

References 1 publication

Supporting

Mentioning

130

Contrasting

Order By: Relevance

“…The most difficult lemmas in our proof are about the type system, and rely on α-equivalence reasoning over type schemes. Similar lemmas, concerning the type system only, were proved by Tofte [27].…”

Section: ⊢ ∀ T Inp Syntax_ok T ⇒ Asm_semantics (Compile T) Inp ⊆ Semsupporting

confidence: 49%

Functional Big-Step Semantics

Owens

Myreen

Kumar

et al. 2016

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. When doing an interactive proof about a piece of software, it is important that the underlying programming language's semantics does not make the proof unnecessarily difficult or unwieldy. Both smallstep and big-step semantics are commonly used, and the latter is typically given by an inductively defined relation. In this paper, we consider an alternative: using a recursive function akin to an interpreter for the language. The advantages include a better induction theorem, less duplication, accessibility to ordinary functional programmers, and the ease of doing symbolic simulation in proofs via rewriting. We believe that this style of semantics is well suited for compiler verification, including proofs of divergence preservation. We do not claim the invention of this style of semantics: our contribution here is to clarify its value, and to explain how it supports several language features that might appear to require a relational or small-step approach. We illustrate the technique on a simple imperative language with C-like for-loops and a break statement, and compare it to a variety of other approaches. We also provide ML and lambda-calculus based examples to illustrate its generality.

show abstract

Section: ⊢ ∀ T Inp Syntax_ok T ⇒ Asm_semantics (Compile T) Inp ⊆ Semsupporting

confidence: 49%

Functional Big-Step Semantics

Owens

Myreen

Kumar

et al. 2016

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…(The smallest fixpoint is always false on value/store pairs that contain a cycle, which is not what we want; it's the greatest fixpoint that gives the expected behavior for C. See [30] Second, values that belongs to a type τ / ∈ T can be exchanged between the app and env worlds without breaking containment.…”

Section: Discussionmentioning

confidence: 99%

“…Despite its simplicity, this type system does not restrict drastically the expressiveness of our language. In particular, recursive functions can still be defined using references [30]. The type algebra is:…”

Section: The Type Systemmentioning

confidence: 99%

See 1 more Smart Citation

Security Properties of Typed Applets

Rouaix

Leroy²

1999

Secure Internet Programming

View full text Add to dashboard Cite

This paper formalizes the folklore result that strongly-typed applets are more secure than untyped ones. We formulate and prove several security properties that all well-typed applets possess, and identify sufficient conditions for the applet execution environment to be safe, such as procedural encapsulation, type abstraction, and systematic type-based placement of run-time checks. These results are a first step towards formal techniques for developing and validating safe execution environments for applets.

show abstract

“…The Tofte discipline [6], used in Standard ML 90 [7], introduced imperative type variables for references, marked by a " * ". They must be instantiated to ground types whenever a side-effect may occur, i.e.…”

Section: Conservative Solutionsmentioning

confidence: 99%

Relaxing the Value Restriction

Garrigue

2004

Functional and Logic Programming

View full text Add to dashboard Cite

Abstract.Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advantages over previous approaches, it forbids polymorphism in many cases where it would be sound. We use a subtyping based approach to recover part of this lost polymorphism, without changing the type algebra itself, and this has significant applications.

show abstract

Type inference for polymorphic references

Cited by 148 publications

References 1 publication

Functional Big-Step Semantics

Functional Big-Step Semantics

Security Properties of Typed Applets

Relaxing the Value Restriction

Contact Info

Product

Resources

About