Sums of uncertainty: refinements go gradual
- 1 January 2017
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 52 (1), 804-817
- https://doi.org/10.1145/3093333.3009865
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Principal Type Schemes for Gradual ProgramsPublished by Association for Computing Machinery (ACM) ,2015
- Confined gradual typingPublished by Association for Computing Machinery (ACM) ,2014
- Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)Lecture Notes in Computer Science, 2010
- Well-Typed Programs Can’t Be BlamedPublished by Springer Science and Business Media LLC ,2009
- A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutionsPublished by Association for Computing Machinery (ACM) ,2008
- Tridirectional typecheckingPublished by Association for Computing Machinery (ACM) ,2004
- A judgmental reconstruction of modal logicMathematical Structures in Computer Science, 2001
- Local type inferenceACM Transactions on Programming Languages and Systems, 2000
- An algorithm for type-checking dependent typesScience of Computer Programming, 1996
- Dynamic typing in a statically typed languageACM Transactions on Programming Languages and Systems, 1991