Scripting the type inference process

Author(s):  
Bastiaan Heeren ◽  
Jurriaan Hage ◽  
S. Doaitse Swierstra
2003 ◽  
Vol 38 (9) ◽  
pp. 3-13 ◽  
Author(s):  
Bastiaan Heeren ◽  
Jurriaan Hage ◽  
S. Doaitse Swierstra

2011 ◽  
Vol 46 (2) ◽  
pp. 43-52 ◽  
Author(s):  
Arie Middelkoop ◽  
Atze Dijkstra ◽  
S. Doaitse Swierstra

2016 ◽  
Vol 51 (10) ◽  
pp. 781-799 ◽  
Author(s):  
Calvin Loncaric ◽  
Satish Chandra ◽  
Cole Schlesinger ◽  
Manu Sridharan

2021 ◽  
pp. 174569162097058
Author(s):  
Olivia Guest ◽  
Andrea E. Martin

Psychology endeavors to develop theories of human capacities and behaviors on the basis of a variety of methodologies and dependent measures. We argue that one of the most divisive factors in psychological science is whether researchers choose to use computational modeling of theories (over and above data) during the scientific-inference process. Modeling is undervalued yet holds promise for advancing psychological science. The inherent demands of computational modeling guide us toward better science by forcing us to conceptually analyze, specify, and formalize intuitions that otherwise remain unexamined—what we dub open theory. Constraining our inference process through modeling enables us to build explanatory and predictive theories. Here, we present scientific inference in psychology as a path function in which each step shapes the next. Computational modeling can constrain these steps, thus advancing scientific inference over and above the stewardship of experimental practice (e.g., preregistration). If psychology continues to eschew computational modeling, we predict more replicability crises and persistent failure at coherent theory building. This is because without formal modeling we lack open and transparent theorizing. We also explain how to formalize, specify, and implement a computational model, emphasizing that the advantages of modeling can be achieved by anyone with benefit to all.


1993 ◽  
Vol 19 (1-2) ◽  
pp. 87-125
Author(s):  
Paola Giannini ◽  
Furio Honsell ◽  
Simona Ronchi Della Rocca

In this paper we investigate the type inference problem for a large class of type assignment systems for the λ-calculus. This is the problem of determining if a term has a type in a given system. We discuss, in particular, a collection of type assignment systems which correspond to the typed systems of Barendregt’s “cube”. Type dependencies being shown redundant, we focus on the strongest of all, Fω, the type assignment version of the system Fω of Girard. In order to manipulate uniformly type inferences we give a syntax directed presentation of Fω and introduce the notions of scheme and of principal type scheme. Making essential use of them, we succeed in reducing the type inference problem for Fω to a restriction of the higher order semi-unification problem and in showing that the conditional type inference problem for Fω is undecidable. Throughout the paper we call attention to open problems and formulate some conjectures.


Sign in / Sign up

Export Citation Format

Share Document