A Type Inference Algorithm for Pure Type Systems
暂无分享,去创建一个
[1] Dieter Kratsch,et al. Finding All Minimal Separators of a Graph , 1994, STACS.
[2] Henk Schepers,et al. A compositional proof theory for fault tolerant real-time distributed systems , 1993, Proceedings of 1993 IEEE 12th Symposium on Reliable Distributed Systems.
[3] Femke van Raamsdonk. Confluence and Superdevelopments , 1993, RTA.
[4] Eric de Kogel,et al. Relational Algebra and Equational Proofs , 1995, Fundam. Informaticae.
[5] Fairouz Kamareddine,et al. The Barendregt Cube with Definitions and Generalised Reduction , 1996, Inf. Comput..
[6] L. D. J. C. Loyens,et al. ILIAS : a sequential language for parallel matrix computations , 1993 .
[7] Gilberto Filé,et al. Freeness Analysis for Logic Programs - And Correctness? , 1993, ICLP.
[8] Whfj Wilbert Körver. Derivation of delay insensitive and speed independent CMOS circuits, using directed commands and production rule sets , 1993 .
[9] L. S. van Benthem Jutting. Typing in Pure Type Systems , 1993, Inf. Comput..
[10] R. D. J. Post,et al. a Graph Oriented Language for Databases , 1993 .
[11] E. Poll,et al. A Typechecker for Bijective Pure Type Systems , 1993 .
[12] van Os Onno Roosmalen,et al. A hierarchical diagrammatic representation of class structure , 1994 .
[13] James McKinna,et al. Checking Algorithms for Pure Type Systems , 1994, TYPES.
[14] H. P. Barendregt. Introduction to generalised type systems, invited talk , 1989 .
[15] W. Ferrer,et al. Abstract reduction and topology , 1993 .
[16] Zhaohui Luo,et al. ECC, an extended calculus of constructions , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.