Dynamic typing: Syntax and proof theory
From MaRDI portal
Publication:1330433
Recommendations
Cited in
(23)- Type inference with partial types
- Encoding types in ML-like languages
- Trends in trends in functional programming 1999/2000 versus 2007/2008
- Session Types with Gradual Typing
- Preemptive Type Checking in Dynamically Typed Languages
- Nested refinements: a logic for duck typing
- Typing dynamic typing
- A delta for hybrid type checking
- scientific article; zbMATH DE number 3982838 (Why is no real title available?)
- scientific article; zbMATH DE number 512785 (Why is no real title available?)
- Typed logics with states
- Call-by-name gradual type theory
- Blame and coercion: Together again for the first time
- Gradual type theory
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
- Explicit effect subtyping
- Call-by-name gradual type theory
- Higher order symbolic execution for contract verification and refutation
- Correctness of compiling polymorphism to dynamic typing
- Space-efficient gradual typing
- Type-directed operational semantics for gradual typing
- Combining behavioural types with security analysis
- A verified framework for higher-order uncurrying optimizations
This page was built for publication: Dynamic typing: Syntax and proof theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330433)