Pages that link to "Item:Q5592242"
From MaRDI portal
The following pages link to The Principal Type-Scheme of an Object in Combinatory Logic (Q5592242):
Displaying 50 items.
- Effect-polymorphic behaviour inference for deadlock checking (Q338624) (← links)
- Semantic types and approximation for Featherweight Java (Q387991) (← links)
- Existential type systems between Church and Curry style (type-free style) (Q402117) (← links)
- The correctness of Newman's typability algorithm and some of its extensions (Q549191) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Two beta-equal lambda-I-terms with no types in common (Q672135) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- Principal type schemes for an extended type theory (Q790801) (← links)
- Type inference for record concatenation and multiple inheritance (Q808687) (← links)
- An NSF proposal (Q815007) (← links)
- A proof-centric approach to mathematical assistants (Q865648) (← links)
- Verification of FPGA layout generators in higher-order logic (Q877830) (← links)
- The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
- Deforestation: Transforming programs to eliminate trees (Q914358) (← links)
- Type inference for polymorphic references (Q918190) (← links)
- Type inference and strong static type checking for Promela (Q988201) (← links)
- Objects and session types (Q1021571) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Principal type scheme and unification for intersection type discipline (Q1110311) (← links)
- Polymorphic type inference and containment (Q1110312) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Condensed detachment is complete for relevance logic: A computer-aided proof (Q1181717) (← links)
- Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus (Q1193590) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
- The converse principal type-scheme theorem in lambda calculus (Q1194107) (← links)
- On subsumption and semiunification in feature algebras (Q1194340) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Principal types of BCK-lambda-terms (Q1208417) (← links)
- A theory of type polymorphism in programming (Q1250704) (← links)
- Extending the type checker of Standard ML by polymorphic recursion (Q1275627) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- Intersection type assignment systems (Q1350344) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- Bidirectional data flow analysis for type inferencing. (Q1399007) (← links)
- Logic programs as compact denotations. (Q1426046) (← links)
- On principal types of combinators (Q1583260) (← links)
- Encoding types in ML-like languages (Q1826630) (← links)
- On the semantics of polymorphism (Q1835664) (← links)
- The completeness theorem for typing lambda-terms (Q1839242) (← links)
- Type inference for variant object types (Q1854549) (← links)
- The Girard-Reynolds isomorphism (Q1887154) (← links)
- Trends in trends in functional programming 1999/2000 versus 2007/2008 (Q1929344) (← links)
- Implementing a method for stochastization of one-step processes in a computer algebra system (Q2216870) (← links)
- Safe functional systems through integrity types and verified assembly (Q2220814) (← links)
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\) (Q2351415) (← links)
- Higher-order unification via combinators (Q2367541) (← links)
- Weak linearization of the lambda calculus (Q2566028) (← links)
- Visible Type Application (Q2802481) (← links)
- Type Reconstruction for $$\lambda $$-DRT Applied to Pronoun Resolution (Q2964002) (← links)
