Grammatical Framework
Open accessThe DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
Grammatical Framework (GF) is a special-purpose functional language for defining grammars. It uses a Logical Framework (LF) for a description of abstract syntax, and adds to this a notation for defining concrete syntax. GF grammars themselves are purely declarative, but can be used both for linearizing syntax trees and parsing strings. GF can describe both formal and natural languages. The key notion of this description is a grammatical object, which is not just a string, but a record that contains all information on inflection and inherent grammatical features such as number and gender in natural languages, or precedence in formal languages. Grammatical objects have a type system, which helps to eliminate run-time errors in language processing. In the same way as a LF, GF uses dependent types in abstract syntax to express semantic conditions, such as well-typedness and proof obligations. Multilingual grammars, where one abstract syntax has many parallel concrete syntaxes, can be used for reliable and meaning-preserving translation. They can also be used in authoring systems, where syntax trees are constructed in an interactive editor similar to proof editors based on LF. While being edited, the trees can simultaneously be viewed in different languages. This paper starts with a gradual introduction to GF, going through a sequence of simpler formalisms till the full power is reached. The introduction is followed by a systematic presentation of the GF formalism and outlines of the main algorithms: partial evaluation and parser generation. The paper concludes by brief discussions of the Haskell implementation of GF, existing applications, and related work.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824 · cited 1×
“Since GF grammars are implemented as first-class data objects in Haskell, well-known analyses and transformations (Hopcroft & Ullman, 1979) can be applied to them.”
MethodHead-driven phrase structure grammar
Sag, I. A., & Pollard, C. (1994) · Medical Entomology and Zoology · Cited by 3,889
The Mental Representation of Grammatical Relations
Baltin, M., & Bresnan, J. (1985) · Language · doi:10.2307/414493 · Cited by 2,783
Semantics of context-free languages
Knuth, D. E. (1968) · Mathematical Systems Theory · doi:10.1007/bf01692511 · Cited by 1,948 · cited 2×
“Later on, the Cornell system used attribute grammars (Knuth, 1968) in the same rle as the GF formalism is used in the GF editor, and Mentor was extended by the formalism framework Metal (Kahn et al. , 1983).”
BackgroundMethodNecula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
An efficient context-free parsing algorithm
Earley, J. (1983) · Communications of the ACM · doi:10.1145/357980.358005 · Cited by 1,606
Martin-Löf, P. (1984) · Bibliopolis eBooks · Cited by 1,590
Partial evaluation and automatic program generation
Jones, N. D., Gomard, C. K., & Sestoft, P. (1993) · Research at the University of Copenhagen (University of Copenhagen) · Cited by 1,581
Implementing Mathematics with The Nuprl Proof Development System
Constable, R. L., Allen, S. F., Bromley, H. M., Cleaveland, W. R., Cremer, J. F., Harper, R. W., Howe, D. J., Knoblock, T. B., Mendler, N. P., Panangaden, P., et al. (1986) · Cited by 1,279
The Mathematics of Sentence Structure
Lambek, J. (1958) · The American Mathematical Monthly · doi:10.1080/00029890.1958.11989160 · Cited by 1,273 · cited 1×
“His idea was developed further by Lambek (1958), resulting in a calculus that covered an impressive fragment of English, and was eventually proved equivalent to context-free grammars (Pentus, 1993).”
Background
Cited by
A history of Haskell: being lazy with class
Hudak, P., Hughes, J., Peyton Jones, S., & Wadler, P. (2007) · Proceedings of the third ACM SIGPLAN conference on History of programming languages · doi:10.1145/1238844.1238856 · Cited by 261
Metadata
- Authors
- RANTA, A.
- Venue
- Journal of Functional Programming
- Publisher
- Cambridge University Press (CUP)
- Published
- 2004-01-22
- Volume
- 14
- Issue
- 2
- Pages
- 145-189
- ISSN
- 0956-7968 (ISSN-L)
- 1469-7653
- OpenAlex
- W1541653499
- Cited by
- 165
- References
- 23
- FWCI
- 12.20
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Grammatical Framework. https://app.cochat.ai/papers/10.1017/s0956796803004738
- The paper
- RANTA, A. (2004). Grammatical Framework. Journal of Functional Programming. https://doi.org/10.1017/s0956796803004738
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.