-
1
-
-
85029547665
-
Definitional trees
-
Kirchner, H, Levi, G, eds, Algebraic and Logic Programming, Springer, Heidelberg
-
Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) Algebraic and Logic Programming. LNCS, vol. 632, pp. 143-157. Springer, Heidelberg (1992)
-
(1992)
LNCS
, vol.632
, pp. 143-157
-
-
Antoy, S.1
-
2
-
-
0043039003
-
Cayenne - a language with dependent types
-
Augustsson, L.: Cayenne - a language with dependent types. ACM SIGPLAN Notices 34(1), 239-250 (1999)
-
(1999)
ACM SIGPLAN Notices
, vol.34
, Issue.1
, pp. 239-250
-
-
Augustsson, L.1
-
4
-
-
0022333721
-
On understanding types, data abstraction and polymorphism
-
Cardelli, L., Wegner, P.: On understanding types, data abstraction and polymorphism. ACM Computing Surveys 17(4), 471-522 (1985)
-
(1985)
ACM Computing Surveys
, vol.17
, Issue.4
, pp. 471-522
-
-
Cardelli, L.1
Wegner, P.2
-
5
-
-
84876766737
-
Combining programming with theorem proving
-
Chen, C., Xi, H.: Combining programming with theorem proving. In: ICFP 2005 (2005), http://www.cs.bu.edu/~hwxi/
-
(2005)
ICFP
-
-
Chen, C.1
Xi, H.2
-
6
-
-
38149079206
-
-
Coquand, C.: Agda is a system for incrementally developing proofs and programs. Web page describing AGDA: http://www.cs.chalmers.se/~catarina/agda/
-
Coquand, C.: Agda is a system for incrementally developing proofs and programs. Web page describing AGDA: http://www.cs.chalmers.se/~catarina/agda/
-
-
-
-
7
-
-
85000405822
-
Inductive definitions and type theory: An introduction (preliminary version)
-
Thiagarajan, P.S, ed, Foundations of Software Technology and Theoretical Computer Science, Springer, Heidelberg
-
Coquand, T., Dybjer, P.: Inductive definitions and type theory: an introduction (preliminary version). In: Thiagarajan, P.S. (ed.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 880, pp. 60-76. Springer, Heidelberg (1994)
-
(1994)
LNCS
, vol.880
, pp. 60-76
-
-
Coquand, T.1
Dybjer, P.2
-
8
-
-
84947926474
-
A refinement-type checker for Standard ML
-
Johnson, M, ed, AMAST 1997, Springer, Heidelberg
-
Davies, R.: A refinement-type checker for Standard ML. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, Springer, Heidelberg (1997)
-
(1997)
LNCS
, vol.1349
-
-
Davies, R.1
-
9
-
-
84949206194
-
-
Dybjer, P., Setzer, A.: A finite axiomatization of inductive-recursive definitions. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, 1581, pp. 129-146. Springer, Heidelberg (1999)
-
Dybjer, P., Setzer, A.: A finite axiomatization of inductive-recursive definitions. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 129-146. Springer, Heidelberg (1999)
-
-
-
-
10
-
-
0034412737
-
Do we need dependent types?
-
Fridlender, D., Indrika, M.: Do we need dependent types? J. Funct. Program 10(4), 409-415 (2000)
-
(2000)
J. Funct. Program
, vol.10
, Issue.4
, pp. 409-415
-
-
Fridlender, D.1
Indrika, M.2
-
11
-
-
38149016524
-
-
Luo, Z., Pollack, R.: LEGO proof development system: User's manual. Technical Report ECS-LFCS-92-211, LFCS, Computer Science Dept., University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, Updated version (May 1992)
-
Luo, Z., Pollack, R.: LEGO proof development system: User's manual. Technical Report ECS-LFCS-92-211, LFCS, Computer Science Dept., University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, Updated version (May 1992)
-
-
-
-
13
-
-
38149005913
-
-
March 20
-
Nordstrom, B.: The ALF proof editor (March 20, 1996), ftp://ftp.es.chalmers.se/pub/users/ilya/FMC/alfintro.ps.gz
-
(1996)
The ALF proof editor
-
-
Nordstrom, B.1
-
14
-
-
38149132015
-
-
Paulson, L.C.: Isabelle: The next 700 theorem provers. In: Odifreddi, P. (ed.) Logic and Computer Science. Logic and Computer Science, pp. 361-386. Academic Press, London (1990)
-
Paulson, L.C.: Isabelle: The next 700 theorem provers. In: Odifreddi, P. (ed.) Logic and Computer Science. Logic and Computer Science, pp. 361-386. Academic Press, London (1990)
-
-
-
-
15
-
-
38149048840
-
Special issue: Haskell 98 language and libraries
-
January
-
Jones, S.P.: Special issue: Haskell 98 language and libraries. Journal of Functional Programming 13 (January 2003)
-
(2003)
Journal of Functional Programming
, vol.13
-
-
Jones, S.P.1
-
16
-
-
35448990873
-
System description: Twelf -A meta-logical framework for deductive systems
-
Ganzinger, H, ed, Automated Deduction, CADE-16, Springer, Heidelberg
-
Pfenning, F., Schürmann, C.: System description: Twelf -A meta-logical framework for deductive systems. In: Ganzinger, H. (ed.) Automated Deduction - CADE-16. LNCS (LNAI), vol. 1632, pp. 202-206. Springer, Heidelberg (1999)
-
(1999)
LNCS (LNAI
, vol.1632
, pp. 202-206
-
-
Pfenning, F.1
Schürmann, C.2
-
17
-
-
0036036524
-
A type system for certified binaries
-
Shao, Z., Saha, B., Trifonov, V., Papaspyrou, N.: A type system for certified binaries. ACM SIGPLAN Notices 37(1), 217-232 (2002)
-
(2002)
ACM SIGPLAN Notices
, vol.37
, Issue.1
, pp. 217-232
-
-
Shao, Z.1
Saha, B.2
Trifonov, V.3
Papaspyrou, N.4
-
18
-
-
38149103822
-
-
Sheard, T.: Using MetaML: A staged programming language. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, 1608, pp. 207-239. Springer, Heidelberg (1999)
-
Sheard, T.: Using MetaML: A staged programming language. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol. 1608, pp. 207-239. Springer, Heidelberg (1999)
-
-
-
-
20
-
-
0033685818
-
Deciding type equivalence in a language with singleton kinds
-
Boston, Massachusetts, pp
-
Stone, C.A., Harper, R.: Deciding type equivalence in a language with singleton kinds. In: Conference Record of POPL'00: The 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, Massachusetts, pp. 214-227 (2000)
-
(2000)
Conference Record of POPL'00: The 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
, pp. 214-227
-
-
Stone, C.A.1
Harper, R.2
-
22
-
-
0013091874
-
MetaML: Multi-stage programming with explicit annotations
-
Taha, W., Sheard, T.: MetaML: Multi-stage programming with explicit annotations. Theoretical Computer Science 248(1-2) (2000)
-
(2000)
Theoretical Computer Science
, vol.248
, Issue.1-2
-
-
Taha, W.1
Sheard, T.2
-
23
-
-
57049139521
-
-
The Coq Development Team, Version 7.4. INRIA
-
The Coq Development Team. The Coq Proof Assistant Reference Manual, Version 7.4. INRIA (2003), http://pauillac.inria.fr/coq/doc/main.html
-
(2003)
The Coq Proof Assistant Reference Manual
-
-
-
24
-
-
38149072021
-
A language-based approach to functionally correct inperative programming
-
Technical report, Washington University in St. Louis, Available at
-
West brook, E., Stump, A., Wehrman, I.: A language-based approach to functionally correct inperative programming. Technical report, Washington University in St. Louis, (2005), Available at: http://cl.cse.wustl.edu/
-
(2005)
-
-
West brook, E.1
Stump, A.2
Wehrman, I.3
-
25
-
-
38149078468
-
-
Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University
-
Xi, H.: Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University (1997)
-
(1997)
-
-
Xi, H.1
-
26
-
-
35048858250
-
Applied type systems
-
Berardi, S, Coppo, M, Damiani, F, eds, TYPES 2003, Springer, Heidelberg
-
Xi, H.: Applied type systems. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 394-408. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.3085
, pp. 394-408
-
-
Xi, H.1
-
27
-
-
0031643965
-
Eliminating array bound checking through dependent types
-
Xi, H., Pfenning, F.: Eliminating array bound checking through dependent types. ACM SIGPLAN Notices 33(5), 249-257 (1998)
-
(1998)
ACM SIGPLAN Notices
, vol.33
, Issue.5
, pp. 249-257
-
-
Xi, H.1
Pfenning, F.2
-
28
-
-
85184302716
-
-
Xi, H., Pfenning, F.: Dependent types in practical programming. In: ACM (ed.) POPL '99. Proceedings of the 26th ACM SIGPLAN-SIGACT on Principles of programming languages, ACM SIGPLAN Notices, New York, NY, USA, January 20-22, 1999, pp. 214-227. ACM Press, New York (1999)
-
Xi, H., Pfenning, F.: Dependent types in practical programming. In: ACM (ed.) POPL '99. Proceedings of the 26th ACM SIGPLAN-SIGACT on Principles of programming languages, ACM SIGPLAN Notices, New York, NY, USA, January 20-22, 1999, pp. 214-227. ACM Press, New York (1999)
-
-
-
|