Existential Type Systems with No Types in Terms-Reference-Cited by-同舟云学术

Existential Type Systems with No Types in Terms

Published:2009 Issue: Volume: Page:112-126
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fujita Ken-etsu,Schubert Aleksy

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02273-9_10

Reference18 articles.

1. Andou, Y.: A normalization-procedure for the first order classical natural deduction with full logical symbols. Tsukuba Journal of Mathematics 19(1), 153–162 (1995)

2. Barendregt, H.: Lambda Calculi with Types. In: Handbook of Logic in Computer Science, vol. II. Oxford University Press, USA (1993)

3. Boehm, H.-J.: Partial polymorphic type inference is undecidable. In: 26th Annual Symposium on Foundations of Computer Science, pp. 339–345. IEEE, Los Alamitos (1985)

4. Barthe, G., Sørensen, M.H.: Domain-free pure type systems. J. Functional Programming 10, 412–452 (2000)

5. Lecture Notes in Computer Science;K. Fujita,2000

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The existential fragment of second-order propositional intuitionistic logic is undecidable;Journal of Applied Non-Classical Logics;2024-01-02

2. Existential type systems between Church and Curry style (type-free style);Theoretical Computer Science;2014-09

3. A note on subject reduction in (→,∃)-Curry with respect to complete developments;Information Processing Letters;2014-01

4. The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types;Information and Computation;2012-09

5. Type checking and typability in domain-free lambda calculi;Theoretical Computer Science;2011-10