summaryrefslogtreecommitdiff
path: root/doc
diff options
context:
space:
mode:
authoraarne <aarne@cs.chalmers.se>2006-02-06 08:28:20 +0000
committeraarne <aarne@cs.chalmers.se>2006-02-06 08:28:20 +0000
commit8876a6a8db269bea5ad03fa104da6c4f8e5875df (patch)
treedf9bdd474ca7b94bd48db02ca5ea2c6ab2536279 /doc
parent9bae44c37d31afa0a05d012d6f4cfa204ec3f125 (diff)
intro to gf-formalism
Diffstat (limited to 'doc')
-rw-r--r--doc/gf-formalism.txt34
1 files changed, 34 insertions, 0 deletions
diff --git a/doc/gf-formalism.txt b/doc/gf-formalism.txt
index ca63656d1..954ff620d 100644
--- a/doc/gf-formalism.txt
+++ b/doc/gf-formalism.txt
@@ -19,6 +19,40 @@ Last update: %%date(%c)
#NEW
+==Logical Frameworks and Grammar Formalisms==
+
+Logic - formalization of mathematics (mathematical language?)
+
+Linguistics - formalization of natural language
+
+Since math lang is a subset, we can expect similarities.
+
+But in natural language we have
+- masses of empirical data
+- no right of reform
+
+
+
+#NEW
+
+==High-level programming==
+
+We have to write a lot of program code when formalizing language.
+
+We need a language with proper abstractions.
+
+Cf. Paul Graham on Prolog: very high-level, but wrong abstractions.
+
+Typed functional languages work well in maths.
+
+We have developed one for linguistics
+- some extra constructs, e.g. inflection tables
+- constraint of reversibility (nontrivial math problem)
+
+
+
+#NEW
+
==GF in a few words==
Grammatical Framework (GF) is a grammar formalism