Basic simple type theory

@article{Francez1998BasicST,
  title={Basic simple type theory},
  author={N. Francez},
  journal={Science of Computer Programming},
  year={1998},
  volume={32},
  pages={211-213}
}
  • N. Francez
  • Published 1998
  • Computer Science
  • Science of Computer Programming
  • 83 Citations

    Topics from this paper

    Hybrid Type-Logical Grammars, First-Order Linear Logic and the Descriptive Inadequacy of Lambda Grammars
    • R. Moot
    • Mathematics, Computer Science
    • ArXiv
    • 2014
    • 12
    • Highly Influenced
    • PDF
    Foundations of Information and Knowledge Systems: 11th International Symposium, FoIKS 2020, Dortmund, Germany, February 17–21, 2020, Proceedings
    • Highly Influenced
    The history of Standard ML
    • Highly Influenced
    • PDF
    Counting a Type's (Principal) Inhabitants
    • 9
    • Highly Influenced
    Infiniteness of Proof(alpha) is Polynomial-Space Complete
    • 8
    • Highly Influenced
    • PDF
    Practical type inference for arbitrary-rank types
    • 193
    • Highly Influenced
    • PDF
    Learnability of type-logical grammars
    • S. Fulop
    • Computer Science, Mathematics
    • Electron. Notes Theor. Comput. Sci.
    • 2001
    • 4
    • Highly Influenced
    • PDF
    Deriving Theorems in Implicational Linear Logic, Declaratively
    • PDF
    Practical Proof Search for Coq by Type Inhabitation
    • 1
    • PDF
    A Higher-Order Calculus of Computational Fields
    • 29
    • PDF