Filters








3,437 Hits in 4.4 sec

On Nominal Regular Languages with Binders [chapter]

Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto
2012 Lecture Notes in Computer Science  
We investigate regular languages on infinite alphabets where words may contain binders on names. To this end, classical regular expressions and automata are extended with binders.  ...  We prove the equivalence between finite automata on binders and regular expressions with binders and investigate closure properties and complementation of regular languages with binders.  ...  In § 3 we define regular languages with binders, nominal regular expressions, and automata on binders. § 4 and 5 contain the main technical contributions of the paper.  ... 
doi:10.1007/978-3-642-28729-9_17 fatcat:ko35ovrwkzbb7lgl7a6ezvn3tu

On Learning Nominal Automata with Binders

Yi Xiao, Emilio Tuosto
2019 Electronic Proceedings in Theoretical Computer Science  
We propose a learning algorithm on nominal regular languages with binders. Our algorithm generalises Angluin's L* algorithm with respect to nominal regular languages with binders.  ...  This class of automata captures nominal regular languages; analogously to the classical language theory, nominal automata have been shown to characterise nominal regular expressions with binders.  ...  We designed a learning algorithm for a class of languages over infinite alphabet; more precisely, we have considered nominal regular languages with binders [25, 27] .  ... 
doi:10.4204/eptcs.304.9 fatcat:3g22jydynjdxda6yrdms2gd7ty

Towards Nominal Formal Languages [article]

Alexander Kurz and Tomoyuki Suzuki and Emilio Tuosto
2011 arXiv   pre-print
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions.  ...  Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.  ...  Nominal Languages We introduce languages with name binders.  ... 
arXiv:1102.3174v2 fatcat:jsgobg3ezbhcxmcucgkjqwk63i

A Kleene Theorem for Nominal Automata

Paul Brunet, Alexandra Silva, Michael Wagner
2019 International Colloquium on Automata, Languages and Programming  
denoting exactly regular nominal languages.  ...  In this paper, we present a Kleene theorem for nominal automata by providing a syntax to denote regular nominal languages.  ...  We want to show that the language R T (L A ) is regular nominal, by building a nominal automaton T (A) with ε-transitions.  ... 
doi:10.4230/lipics.icalp.2019.107 dblp:conf/icalp/Brunet019 fatcat:n77xp2w4lff6hcmvt3oqzsbhpa

A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions [chapter]

Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto
2012 Lecture Notes in Computer Science  
We give a characterisation of languages on infinite alphabets in a variant of nominal regular expressions with permutations (p-NREs).  ...  Finally, we give a Kleene theorem for p-NREs and fp-automata to formally characterise languages on infinite alphabets.  ...  Finally, we argue that the work nominal languages with binders also sheds new light on well-established work on languages on infinite alphabets. Related Work.  ... 
doi:10.1007/978-3-642-33475-7_14 fatcat:w6hw6iq4gjb7dpo53mw3lfddhu

Model checking hybrid logics (with an application to semistructured data)

Massimo Franceschet, Maarten de Rijke
2006 Journal of Applied Logic  
We provide model checking algorithms for various hybrid fragments and we prove PSPACE-completeness for hybrid fragments including binders.  ...  We complement and motivate our complexity results with an application of model checking in hybrid logic to the problems of query and constraint evaluation for semistructured data.  ...  the regular expression rexp 2 , and so on.  ... 
doi:10.1016/j.jal.2005.06.010 fatcat:o6bhiaj73jbt7nyo6cozffz6iq

Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract [article]

Alexander Kurz and Tomoyuki Suzuki and Emilio Tuosto
2013 arXiv   pre-print
formal languages in terms of nominal automata.  ...  Inspired by nominal techniques -- as those popular in process calculi -- we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation  ...  We define nominal regular expressions (NREs, for short) by extending classical regular expressions with names n ∈ N and name binders.  ... 
arXiv:1310.7093v1 fatcat:rxvn5462grcwtb5tucn4wyixoa

Binders unbound

Stephanie Weirich, Brent A. Yorgey, Tim Sheard
2011 Proceeding of the 16th ACM SIGPLAN international conference on Functional programming - ICFP '11  
Our language is particularly expressive-it supports multiple atom types, pattern binders, type annotations, recursive binders, and nested binding (necessary for telescopes, a feature found in dependently-typed  ...  languages).  ...  Acknowledgments Chris Casinghino, Vilhelm Sjöberg and the rest of the TRELLYS team provided valuable feedback on this work.  ... 
doi:10.1145/2034773.2034818 dblp:conf/icfp/WeirichYS11 fatcat:cbfij5tnovhbro425dpfshidba

Binders unbound

Stephanie Weirich, Brent A. Yorgey, Tim Sheard
2011 SIGPLAN notices  
Our language is particularly expressive-it supports multiple atom types, pattern binders, type annotations, recursive binders, and nested binding (necessary for telescopes, a feature found in dependently-typed  ...  languages).  ...  Acknowledgments Chris Casinghino, Vilhelm Sjöberg and the rest of the TRELLYS team provided valuable feedback on this work.  ... 
doi:10.1145/2034574.2034818 fatcat:n4yx36elsvb2djr5uesok64i6m

Formalisation in Constructive Type Theory of Barendregt's Variable Convention for Generic Structures with Binders

Ernesto Copello, Nora Szasz, Álvaro Tasistro
2018 Electronic Proceedings in Theoretical Computer Science  
We introduce a universe of regular datatypes with variable binding information, for which we define generic formation and elimination (i.e. induction /recursion) operators.  ...  We then define a generic alpha-equivalence relation over the types of the universe based on name-swapping, and derive iteration and induction principles which work modulo alpha-conversion capturing Barendregt's  ...  These languages allow to deconstruct datatypes with binders in a safe way, that is, in the case of an abstraction inspection, a renaming with a freshly generated binder is computed for the abstraction  ... 
doi:10.4204/eptcs.274.2 fatcat:vcjqyzsrkbh7joszbrij3cbn3y

GMeta: A Generic Formal Metatheory Framework for First-Order Representations [chapter]

Gyesik Lee, Bruno C. D. S. Oliveira, Sungkeun Cho, Kwangkeun Yi
2012 Lecture Notes in Computer Science  
We conducted case studies based on the POPLmark challenge, and showed that dealing with challenging binding constructs, like the ones found in System F<:, is possible with GMeta.  ...  Using a generic universe for representing a large family of object languages we define datatype-generic libraries of infrastructure for first-order representations such as locally nameless or de Bruijn  ...  We are especially grateful to Sungwoo Park, which has provided us with many useful comments and suggestions.  ... 
doi:10.1007/978-3-642-28869-2_22 fatcat:vdthkrhhuzbwdb7e76rzl7bccm

Rezension von: Freidin, Robert (ed.) (1991): Principles and Parameters in Comparative Grammar. Cambridge, MA: MIT Press

Katharina Hartmann
1994 Zeitschrift für Sprachwissenschaft  
The first two papers deal with Binding Theory.  ...  This extension of the nominal inventory needs an additional feature in order to categorize the distribution of the nominal expressions.  ...  They can be coindexed with the matrix subject in infinite but not in finite sentences, which shows that only a finite AGR coindexed with a nominal subject may serve as a binder.  ... 
doi:10.1515/zfsw.1994.13.1.129 fatcat:z7wljm4ykbfhvpasoq62e56rxq

Page 1699 of Linguistics and Language Behavior Abstracts: LLBA Vol. 29, Issue 4 [page]

1995 Linguistics and Language Behavior Abstracts: LLBA  
The locality restrictions associated with dou are argued to vary depending on the element with which it is associated.  ...  With regu- lar NPs, the locality is reflected by LF adjunction of dou, & with wh-polarity items, the locality is restricted by licensing of polarity items & its ability as a binder. 43 References.  ... 

Needle & Knot: Binder Boilerplate Tied Up [chapter]

Steven Keuchel, Stephanie Weirich, Tom Schrijvers
2016 Lecture Notes in Computer Science  
As a consequence, the human mechanizer is still unnecessarily burdened with binder boilerplate and discouraged from taking on richer languages.  ...  Knot is a highly expressive language for natural and concise specification of syntax with binders.  ...  Nominal Isabelle [36] is an extension of the Isabelle/HOL framework with support for nominal terms which provides α-equivalence for free.  ... 
doi:10.1007/978-3-662-49498-1_17 fatcat:lvbzbifqtzegbn3t5t3cfy3evq

Nominal Kleene Coalgebra [chapter]

Dexter Kozen, Konstantinos Mamouras, Daniela Petrişan, Alexandra Silva
2015 Lecture Notes in Computer Science  
We develop the coalgebraic theory of nominal Kleene algebra, including an alternative language-theoretic semantics, a nominal extension of the Brzozowski derivative, and a bisimulation-based decision procedure  ...  Kurz, Suzuki, Tuosto [16, 17] present a syntax of regular expressions with binders and consider its relationship with nominal automata.  ...  Recently, there have been many studies involving nominal automata, automata on infinite alphabets, and regular expressions with binders that are closely related to the work presented here.  ... 
doi:10.1007/978-3-662-47666-6_23 fatcat:lqghiundozhxhlaz4zqcylmezm
« Previous Showing results 1 — 15 out of 3,437 results