Dynamic typing: Syntax and proof theory

DOI10.1016/0167-6423(94)00004-2zbMath0809.68083OpenAlexW2133828278MaRDI QIDQ1330433

Fritz Henglein

Publication date: 21 July 1994

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(94)00004-2

zbMATH Keywords

dynamic type coercionsdynamically typed \(\lambda\)-calculus

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17) Combinatory logic and lambda calculus (03B40)

Related Items (15)

Explicit effect subtyping ⋮ Unnamed Item ⋮ A Delta for Hybrid Type Checking ⋮ Trends in trends in functional programming 1999/2000 versus 2007/2008 ⋮ Combining behavioural types with security analysis ⋮ Higher order symbolic execution for contract verification and refutation ⋮ Space-efficient gradual typing ⋮ Call-by-name Gradual Type Theory ⋮ A verified framework for higher-order uncurrying optimizations ⋮ Session Types with Gradual Typing ⋮ Encoding types in ML-like languages ⋮ Blame and coercion: Together again for the first time ⋮ Gradual type theory ⋮ Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi ⋮ Type inference with partial types

This page was built for publication: Dynamic typing: Syntax and proof theory