Filters








12 Hits in 7.8 sec

Combings of groups and the grammar of reparameterization

Martin R. Bridson
2003 Commentarii Mathematici Helvetici  
A new construction of combings is used to distinguish between several previously indistinguishable classes of groups associated to the theory of automatic groups and non-positive curvature in group theory  ...  The words in Σ * which can be derived in this way form the language generated by the grammar. Words in (N ∪ Σ ∪ F ) * are called sentential forms.  ...  If a sentential form β can be obtained from a sentential form α by a finite sequence of productions, then one writes α * → β.  ... 
doi:10.1007/s00014-003-0776-7 fatcat:u2ueah3k2nbhpir4of733fgu5a

Study of the Subtyping Machine of Nominal Subtyping with Variance (full version) [article]

Ori Roth
2021 arXiv   pre-print
We depict the lattice of fragments of Kennedy and Pierce's type system and characterize their computing power in terms of regular, context-free, deterministic, and non-deterministic tree languages.  ...  This is a study of the computing power of the subtyping machine behind Kennedy and Pierce's nominal subtyping with variance.  ...  Intermediate trees, members of (Σ ∪ ) △ , are called tree forms, similar to sentential forms of string grammars. Let be a finite set of parameter leaf symbols, disjoint to sets Σ and .  ... 
arXiv:2109.03950v1 fatcat:n7p7q2z5wnfd7dtid2skulig6a

Multiple context-free tree grammars: Lexicalization and characterization

Joost Engelfriet, Andreas Maletti, Sebastian Maneth
2018 Theoretical Computer Science  
A tree language can be generated by a multiple context-free tree grammar if and only if it is the image of a regular tree language under a deterministic finite-copying macro tree transducer.  ...  Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting".  ...  thus, it is the usual rewriting of a nonterminal in a sentential form of a context-free grammar.  ... 
doi:10.1016/j.tcs.2018.03.014 fatcat:5brpoklfvregzlu3ewqxow4tjy

Multiple Context-Free Tree Grammars: Lexicalization and Characterization [article]

Joost Engelfriet, Andreas Maletti, Sebastian Maneth
2017 arXiv   pre-print
A tree language can be generated by a multiple context-free tree grammar if and only if it is the image of a regular tree language under a deterministic finite-copying macro tree transducer.  ...  Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting".  ...  thus, it is the usual rewriting of a nonterminal in a sentential form of a context-free grammar.  ... 
arXiv:1707.03457v1 fatcat:mhkis4o4gnhjtc6kuajwsratme

A formalisation of the theory of context-free languages in higher order logic [article]

Aditi Barthwal, University, The Australian National, University, The Australian National
2015
We have mechanised classical results involving context-free grammars and pushdown automata.  ...  the grammar.  ...  Acknowledgements The Little Person and the Quest for the PhD  ... 
doi:10.25911/5d6e4c3c4b543 fatcat:a55lb5rvy5a5pc2nz4uroso3uy

The Semantics of Kwak'wala Object Case

Katherine Ann Sardinha
2018 Berkeley Papers in Formal Linguistics  
For instance, many of the example forms Boas cites, such as c ̓ os (c ̓ o=s) 'he gives it (INST)', and c ̓ ənkʷəs (c ̓ ənkʷ=s)'he was angry with him (INST)' (both of which are listed on Boas 1947, p.  ...  match up. (177) Event-Path homomorphism t 1 t 2 t 3 … t n 'time line' | | | | loc 1 loc 2 loc 3 … loc n 'spatial path' (adapted from Ramchand 1997: p. 117) Ramchand (1997) , extending the framework in  ...  is formed (10).  ... 
doi:10.5070/bf211039923 fatcat:herzwdcqyjcdpcarh4cvhlogjm

A Tool for Producing Verified, Explainable Proofs

Edward Ayers, Apollo-University Of Cambridge Repository, William Gowers, Mateja Jamnik
2022
The system produces output in the form of both natural language and formal proof terms which are checked by Lean's kernel.  ...  The system provides a visual, hierarchical representation of the goal and a system for suggesting available inference rules.  ...  Grebing then provides a bridge for this gap in the form of a proof scripting language and user interface for the KeY prover at a higher level of abstraction than the existing interface.  ... 
doi:10.17863/cam.81869 fatcat:kr3qj52t2fbvpaz5uaplwquwum

The Semantics of Kʷak ̓ ʷala Object Case The Semantics of Kʷak ̓ ʷala Object Case

Katherine Sardinha, Katherine Sardinha, Katherine Sardinha, Mikkelsen
2017 unpublished
ACC Though nəp-'throw' is semantically ditransitive, it can be realized syntactically as monotransitive, either with an expressed Theme and no Goal, as in (258) , or with an expressed Goal and no Theme  ...  For instance, many of the example forms Boas cites, such as c ̓ os (c ̓ o=s) 'he gives it (INST)', and c ̓ ənkʷəs (c ̓ ənkʷ=s)'he was angry with him (INST)' (both of which are listed on Boas 1947, p.  ...  match up. (177) Event-Path homomorphism t 1 t 2 t 3 … t n 'time line' | | | | loc 1 loc 2 loc 3 … loc n 'spatial path' (adapted from Ramchand 1997: p. 117) Ramchand (1997) , extending the framework in  ... 
fatcat:ehwm3m4mljafpav5laanhhnwqa

Proceedings of the Workshop on Syntax of Predication, Nov 2-3, 2001, ZAS-Berlin

Niina Zhang
2019
Predication is a many-faceted topic which involves both syntax and semantics and the interface between them. This is reflected in the papers of the volume.  ...  This volume presents working versions of presentations heard at and selected for the Workshop on Syntax of Predication, held at ZAS, Berlin, on November 2-3, 2001 (except the editor's own paper).  ...  to the sentential subject and object.  ... 
doi:10.21248/zaspil.26.2001.135 fatcat:4oc4ubdn2rhi7e2ck6uho7n2qm

Title The Semantics of Kʷak̓ ʷala Object Case The Semantics of Kʷak ̓ ʷala Object Case The Semantics of Kʷak ̓ ʷala Object Case

Author Sardinha, Katherine, Katherine Sardinha, Katherine Sardinha, Katherine Sardinha, Mikkelsen
2017 unpublished
Goal and no Theme, as in (259).  ...  Acknowledgements x ACC Though nəp-'throw' is semantically ditransitive, it can be realized syntactically as monotransitive, either with an expressed Theme and no Goal, as in (258) , or with an expressed  ...  For instance, many of the example forms Boas cites, such as c ̓ os (c ̓ o=s) 'he gives it (INST)', and c ̓ ənkʷəs (c ̓ ənkʷ=s)'he was angry with him (INST)' (both of which are listed on Boas 1947, p.  ... 
fatcat:lch7o5ej2fgthgkb5yw6mb2y74

Proceedings of the Sinn und Bedeutung 10

Christian Ebert, Cornelia Endriss
2019
Acknowledgments We are very grateful to our colleagues and teachers at the SfS, especially Arnim von Stechow, Doris Penka and Hedde Zeijlstra, for the instructive discussions and the support.  ...  Special thanks go to Magdalena Schwager for her critical and helpful comments.  ...  Specifically, I challenge the view that passives and anticausatives are formed in different modules of the grammar and offer a uniform analysis for both constructions.  ... 
doi:10.21248/zaspil.44.2006.295 fatcat:eymwsrl4una5fjq5tcc23my5oy

Predicate-induced semantic prominence in online argument linking: experiments on affectedness and analytical tools [article]

Philip Rausch, Humboldt-Universität Zu Berlin, Humboldt-Universität Zu Berlin
2018
and argument-inherent semantic argument prominence.  ...  This pattern was accompanied by consistent reading time and ERP interaction effects.  ...  Abstract The present thesis consists of two parts.  ... 
doi:10.18452/19305 fatcat:pesyiyztarbvtmr4umx5uq4ehi