MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Principal typing-schemes in a polyadic -calculus (1993) [11 citations — 8 self]

Download:
Download as a PDF | Download as a PS
by Vasco Thudichum Vasconcelos, Kohei Honda
In 4th International Conference on Concurrency Theory, volume 715 of LNCS
http://www.di.fc.ul.pt/~vv/papers/pitypings-keioreport.ps.gz
Add To MetaCart

Abstract:

send

Citations

2003 The Design and Analysis of Computer Algorithms – Aho, Hopcroft, et al. - 1974
1463 A Proposal for Standard ML – Milner - 1984
801 A theory of type polymorphism in programming – Milner - 1978
316 The polyadic -calculus: a tutorial – Milner - 1991
256 Principal type-schemes for functional programs – Damas, Milner - 1982
215 Report on the Programming Language Haskell, A Non-strict, Purely Functional Language – Hudak, Jones, et al. - 1992
191 Introduction to combinators and *-calculus – Hindley, Seldin - 1988
125 Fundamental properties of infinite trees – Courcelle - 1983
113 The principal type-scheme of an object in combinatory logic – Hindley - 1969
67 On asynchronous communication semantics – Honda, Tokoro - 1992
45 Two Extensions of Curry's Type Inference System – Cardone, Coppo - 1990
43 Types for dyadic interaction – Honda - 1993
18 Logic and Logic Programming – Robinson - 1992
17 The complexity of unification – Baxter - 1977
4 Functions as Processes. Automata, Language and – Milner - 1990
4 Fast unification – Robinson - 1976
1 R'esolution d"equations dans langages d'ordre 1; 2 – Huet - 1976
1 Sorts and Types in the ��-Calculus – Milner - 1990
1 Handbook of Theoretical Computer Science, chapter Type Systems for Programming Languages – Mitchell - 1990