120 search results - page 13 / 24 » Theorems for Free! |
LACL
2001
Springer
14 years 23 hour ago
2001
Springer
Lambek [13] introduces pregroups as a new framework for syntactic structure. In this paper we prove some new theorems on pregroups and study grammars based on the calculus of free...
ECML
2003
Springer
14 years 24 days ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
A bidirectional transformation consists of a function get that takes a source (document or value) to a view and a function put that takes an updated view and the original source b...