Grammatical Framework: A Type-Theoretical Grammar Formalism

Journal of Functional Programming

Volumn 14, Issue 2, 2004, Pages 145-189

  Ranta, Aarne ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

GRAMMATICAL FRAMEWORK (GF); RUN TIME ERRORS;

ABSTRACTING; ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER OPERATING SYSTEMS; COMPUTER PROGRAMMING LANGUAGES; LINGUISTICS; SEMANTICS; TRANSLATION (LANGUAGES); TREES (MATHEMATICS);

FORMAL LANGUAGES;

EID: 1142267381     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796803004738     Document Type: Review

References (62)

1. Abrusci, M. (1990) Noncommutative Intuitionistic Linear Prepositional Logic. Zeitschrift fr Mathematische Logik und Grundlagen der Mathematik, 36, 297-398.
2. Augustsson, L. (1998) Cayenne - a language with dependent types. Proc. ICFP'98. ACM Press.
3. Bar-Hillel, Y. (1953) A quasi-arithmetical notation for syntactic description. Language, 29, 27-58.
4. Bescherelle. (1997) La conjugaison pour tous. Hatier.
5. Bohlin, P., Bos, J., Larsson, S., Lewin, I., Matheson, C. and Milward, D. (1999) Survey of existing interactive systems. Trindi deliverable D1.3, Gothenburg University.
6. Bresnan, J. (ed). (1982) The Mental Representation of Grammatical Relations. MIT Press.
7. Carlsson, M. and Hallgren, T. (1998) Fudgets - Purely Functional Processes with applications to Graphical User Interfaces. Ph.D. thesis, Department of Computing Science, Chalmers University of Technology.
8. Constable, R. L. (1986) Implementing Mathematics with the NuPRL Proof Development System. Prentice-Hall.
9. Coquand, T. (1996) An algorithm for type checking dependent types. Science of Computer Programming, 26, 167-177.
10. Coscoy, Y., Kahn, G. and Théry, L. (1995) Extracting text from proofs. In : Dezani-Ciancaglini, M. & Plotkin, G. (eds.), Proc. Second Int. Conf. on Typed Lambda Calculi and Applications: LNCS 902, pp. 109-123. Springer-Verlag.
11. Curry, H. B. (1963) Some logical aspects of grammatical structure. In: Jakobson, R. (ed.), Structure of Language and its Mathematical Aspects: Proceedings of the Twelfth Symposium in Applied Mathematics, pp. 56-68. American Mathematical Society.
12. de Bruijn, N. G. (1994) Mathematical Vernacular: a Language for Mathematics with Typed Sets, xIn: Nederpelt, R. (ed.), Selected Papers on Automath, pp. 56-68. North-Holland.
13. Donzeau-Gouge, V., Huet, G., Kahn, G., Lang, B. and Lévy, J. J. (1975) A structure-oriented program editor: a first step towards computer assisted programming. International Computing Symposium (ICS'75).
14. Dymetman, M. Lux, V. and Ranta, A. (2000) XML and multilingual document authoring: Convergent trends. COLING, pp. 243-249. Saarbrücken, Germany.
15. Earley, J. (1970) An efficient context-free parsing algorithm. Comm. ACM, 13(2), 94-102.
16. Fiedler, A. (2001) User-Adaptive Proof Explanation. PhD thesis, Universität des Saarlandes.
17. Frost, R. and Launchbury, J. (1989) Constructing natural language interpreters in a lazy functional language. Comput. J. 32(2), 108-121.
18. Hallgren, T. (2000) Home Page of the Proof Editor Alfa. http://www.cs.chalmers.se/̃hallgren/Alfa/
19. Hallgren, T. and Ranta, A. (2000) An extensible proof text editor. In: Parigot, M. and Voronkov, A. (eds.), LPAR-2000: LNCS/LNAI 1955, pp. 70-84. Springer-Verlag.
20. Harper, R., Honsell, F. and Plotkin, G. (1993) A Framework for Defining Logics. J. ACM, 40(1), 143-184.
21. Hähnle, R. Johannisson, K. and Ranta, A. (2002) An authoring tool for informal and formal requirements specifications. In: Kutsche, R.-D. and Weber, H. (eds.), Fundamental Approaches to Software Engineering: LNCS 2306, pp. 233-248. Springer-Verlag.
22. Hopcroft, J. and Ullman, J. (1979) Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
23. Hudak, P. (1996) Building domain-specific embedded languages. ACM Comput. Surv., 28(4).
24. Huet, G. (1997) The Zipper. J. Functional Program. 7(5), 549-554.
25. Huet, G. (2000) Sanskrit site. Program and documentation, http://pauillac.inria.fr/̃huet/SKT/.
26. Johannisson, K. and Ranta, A. (2001) Formal verification of multilingual instructions. The Joint Winter Meeting of Computing Science and Computer Engineering. Chalmers University of Technology.
27. Johnson, S. C. (1975) Yacc - yet another compiler compiler. Technical report CSTR-32, AT & T Bell Laboratories, Murray Hill, NJ.
28. Jones, M. and Hudak, P. (1995) Using types to parse natural language. Proceedings Glasgow Workshop on Functional Programming.
29. Jones, N. D., Gomard, C. K. and Sestoft, P. (1993) Partial Evaluation and Automatic Program Generation. Prentice-Hall.
30. Joshi, A. (1985) Tree-adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions. In: Dowty, D., Karttunen, L. and Zwicky, A. (eds.), Natural Language Parsing, pp. 206-250. Cambridge University Press.
31. Kahn, G., Lang, B., Mélèse, B. and Morcos, E. (1983) Metal: a formalism to specify formalisms. Sci. Comput. Program. 3, 151-188.
32. Kay, M. (1997) The Proper Place of Men and Machines in Language Translation. Machine Translation, 12(1-2), 3-23.
33. Knuth, D. (1965) On the translation of languages from left to right. Infor. Control, 8, 607-639.
34. Knuth, D. (1968) Semantics of context-free languages. Math. Syst. Theory, 2, 127-145.
35. Lambek, J. (1958) The mathematics of sentence structure. Am. Math. Monthly, 65, 154-170.
36. Luo, Z. and Callaghan, P. (1999) Mathematical vernacular and conceptual well-formedness in mathematical language. In: Lecomte, A., Lamarche, F. and Perrier, G. (eds.), Logical Aspects of Computational Linguistics (LACL): LNCS/LNAI 1582, pp. 231-250.
37. Luo, Z. and Pollack, R. (1992) LEGO Proof Development System. Technical report, University of Edinburgh.
38. Mäenpää, P. and Ranta, A. (1999) The type theory and type checker of GF. PLI-1999: Workshop on Logical Frameworks and Meta-languages, Paris, France.
39. Magnusson, L. and Nordström, B. (1994) The ALF proof editor and its proof engine. In: Types for Proofs and Programs: LNCS 806, pp. 213-237. Springer-Verlag.
40. Marlow, S. (2001) Happy, The Parser Generator for Haskell. http://www.haskell.org/happy/.
41. Martin-Löf, P. (1984) Intuitionistic Type Theory. Napoli: Bibliopolis.
42. Montague, R. (1974) Formal Philosophy. Yale University Press.
43. Morrill, G. (1994) Type Logical Grammar. Kluwer.
44. Necula, G. C. (1997) Proof-Carrying Code. Proc. 24th ACM Symposium on Principles of Programming Languages, pp. 106-119. Paris, France. ACM Press.
45. Nordström, B., Petersson, K. and Smith, J. M. (1990) Programming in Martin-Löf's Type Theory. An Introduction. Oxford University Press.
46. Paulson, L. (2002) The Isabelle Reference Manual. Available at the Isabelle homepage http://www.cl.cam.ac.uk/Research/HVG/Isabelle/ With contributions by T. Nipkow and M. Wenzel.
47. Pentus, M. (1993) Lambek grammars are context-free. LICS, pp. 35-43. Utrecht, The Netherlands.
48. Pereira, F. and Warren, D. (1980) Definite clause grammars for language analysis - a survey of the formalism and a comparison with augmented transition networks. Artif. Intell., 13, 231-278.
49. Peyton Jones, S. and Hughes, J. (1999) Report on the Programming Language Haskell 98, a Non-strict, Purely Functional Language. Available from http://www.haskell.org
50. Pollard, C. and Sag, I. (1994) Head-Driven Phrase Structure Grammar. University of Chicago Press.
51. Power, R. and Scott, D. (1998) Multilingual authoring using feedback texts. COLING-ACL.
52. Prawitz, D. (1965) Natural Deduction. Stockholm: Almqvist & Wiksell.
53. Ranta, A. (1994) Type Theoretical Grammar. Oxford University Press.
54. Ranta, A. (2002) Grammatical Framework Homepage. www.cs.chalmers.se/̃aarne/GF/.
55. Ranta, A. and Cooper, R. (2001) Dialogue systems as proof editors. IJCAR/ICoS-3.
56. Rosetta, M. T. (1994) Compositional translation. Kluwer.
57. Shieber, S. (1986) An Introduction to Unification-Based Approaches to Grammars. University of Chicago Press.
58. Steedman, M. (1988) Combinators and grammars. In: Oehrle, R., Bach, E. and Wheeler, D. (eds.), Categorial Grammars and Natural Language Structures, pp. 417-442. Reidel.
59. Teitelbaum, T. and Reps, T. (1981) The Cornell Program Synthesizer: a syntax-directed programming environment. Commun. ACM, 24(9), 563-573.
60. The Boeing Company (2001) Boeing Simplified English Checker, http://www.boeing.com/assocproducts/sechecker/
61. The Coq Development Team. (1999) The Coq Proof Assistant Reference Manual, pauillac.inria.fr/coq/.
62. Warmer, J. and Kleppe, A. (1999) The Object Constraint Language: Precise Modelling with UML. Addison-Wesley.