Hybrid type checking
Authors:
Open Access
- 1 January 2010
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 32 (2) , 1-34
Abstract
Traditional static type systems are effective for verifying basic interface specifications. Dynamically checked contracts support more precise specifications, but these are not checked until runtime, resulting in incomplete detection of defects. Hybrid type checking is a synthesis of these two approaches that enforces precise interface specifications, via static analysis where possible, but also via dynamic checks where necessary. This article explores the key ideas and implications of hybrid type checking, in the context of the λ-calculus extended withcontract types, that is, with dependent function types and with arbitrary refinements of base types.Keywords
Funding Information
- National Science Foundation (CCR-0341179CCR-0707885)
This publication has 33 references indexed in Scilit:
- Sound and complete models of contractsJournal of Functional Programming, 2006
- Simplify: a theorem prover for program checkingJournal of the ACM, 2005
- From system F to typed assembly languageACM Transactions on Programming Languages and Systems, 1999
- TILACM SIGPLAN Notices, 1996
- A Syntactic Approach to Type SoundnessInformation and Computation, 1994
- Dynamic typing: syntax and proof theoryScience of Computer Programming, 1994
- Inheritance as implicit coercionInformation and Computation, 1991
- The Turing programming languageCommunications of the ACM, 1988
- Logical relations and the typed λ-calculusInformation and Control, 1985
- A technique for software module specification with examplesCommunications of the ACM, 1972