MBase: Representing Knowledge and Context for the Integration of Mathematical Software Systems
暂无分享,去创建一个
[1] Kim B. Bruce,et al. Guest Editorial: Foundations of Object-Oriented Languages , 2002, Inf. Comput..
[2] Jacques Garrigue,et al. Label-Selective lambda-Calculus Syntax and Confluence , 1995, Theor. Comput. Sci..
[3] Ian Green,et al. System description : Proof planning in higher-order logic with λ Clam , 1998 .
[4] Atsushi Ohori,et al. A polymorphic record calculus and its compilation , 1995, TOPL.
[5] J. Roger Hindley,et al. Introduction to Combinators and Lambda-Calculus , 1986 .
[6] Dieter Hutter,et al. Towards an Evolutionary Formal Software-Development Using CASL , 1999, WADT.
[7] Michael Kohlhase,et al. OMDOC: Towards an Internet Standard for the Administration, Distribution, and Teaching of Mathematical Knowledge , 2000, AISC.
[8] Gerhard Goos,et al. Artificial Intelligence: Methodology, Systems, and Applications , 2003, Lecture Notes in Computer Science.
[9] Dieter Hutter,et al. INKA: The Next Generation , 1996, CADE.
[10] Michael Kohlhase,et al. System Description: MathWeb, an Agent-Based Communication Layer for Distributed Automated Theorem Proving , 1999, CADE.
[11] Jörg H. Siekmann,et al. Planning Diagonalization Proofs , 1998, AIMSA.
[12] William M. Farmer,et al. Theory Interpretation in Simple Type Theory , 1993, HOA.
[13] H. Ebbinghaus,et al. Einführung in die Mengenlehre , 1977 .
[14] Manfred Kerber. How to Prove Higher Order Theorems in First Order Logic , 1991, IJCAI.
[15] Volker Sorge,et al. Agent-Oriented Integration of Distributed Mathematical Services , 1999, J. Univers. Comput. Sci..
[16] Richard J. Boulton,et al. An Interface between Clam and HOL , 1998, TPHOLs.
[17] de Ng Dick Bruijn,et al. The Mathematical Vernacular, A Language for Mathematics with Typed Sets , 1994 .
[18] Rp Rob Nederpelt,et al. Selected papers on Automath , 1994 .
[19] Jacques Calmet,et al. Theorems and algorithms: an interface between Isabelle and Maple , 1995, ISSAC '95.
[20] Peter B. Andrews. An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.
[21] Douglas J. Howe. Semantic Foundations for Embedding HOL in Nuprl , 1996, AMAST.
[22] Volker Sorge,et al. Omega: Towards a Mathematical Assistant , 1997, CADE.
[23] J. Grundy,et al. Theorem Proving in Higher Order Logics : Emerging Trends 11th International Conference, Tphols '98, Canberra, Australia, September 27-October 2, 1997 ; Supplementary Proceedings' , 1998 .
[24] Volker Sorge,et al. Adaptive Course Generation and Presentation , 2000 .
[25] Peter B. Andrews,et al. Selectively Instantiating Definitions , 1998, CADE.
[26] Jan van Leeuwen,et al. Computer Science Today , 1995, Lecture Notes in Computer Science.
[27] Hans-Dieter Ehrich,et al. Specification of abstract data types , 1996 .
[28] Xiaorong Huang,et al. Presenting Machine-Found Proofs , 1996, CADE.
[29] Steve Linton,et al. VSDITLU: a verifiable symbolic definite integral table look-up , 1999, CADE.
[30] A. Fraenkel,et al. Zu den Grundlagen der Cantor-Zermeloschen Mengenlehre , 1922 .
[31] Tim Finin,et al. KQML - A Language and Protocol for Knowledge and Information Exchange , 1994 .
[32] Gert Smolka. The Oz Programming Model , 1996 .