Undoing dynamic typing (declarative pearl)

Authors:
Nick Benton
Affiliations:
Microsoft Research
Venue:
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Year:
2008

Citing 17
Cited 0

Dynamic typing in a statically typed language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Eiffel: the language

Eiffel: the language
Dynamic typing

ESOP'92 Symposium proceedings on 4th European symposium on programming
Composing first-class transactions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Type-directed partial evaluation

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Encoding types in ML-like languages

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Contracts for higher-order functions

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
A Simple Solution to Type Specialization

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Functional unparsing

Journal of Functional Programming
FUNCTIONAL PEARL Pickler combinators

Journal of Functional Programming
Embedded interpreters

Journal of Functional Programming
Sound and complete models of contracts

Journal of Functional Programming
Operational semantics for multi-language programs

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed contracts for functional programming

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Contracts as pairs of projections

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Embedding an interpreted language using higher-order functions and types

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose undoable versions of the projection operations used when programs written in higher-order statically-typed languages interoperate with dynamically typed ones, localizing potential runtime errors to the point at which a dynamic value is projected to a static type. The idea is demonstrated by using control operators to implement backtracking projections from an untyped Scheme-like language to ML.