Mostrar el registro sencillo del ítem

Recognizability in the Simply Typed Lambda-Calculus

hal.structure.identifierLinguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
dc.contributor.authorSALVATI, Sylvain
dc.date.accessioned2024-04-15T09:50:24Z
dc.date.available2024-04-15T09:50:24Z
dc.date.issued2009
dc.date.conference2009
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198338
dc.description.abstractEnWe define a notion of recognizable sets of simply typed λ-terms that extends the notion of recognizable sets of strings or trees. This definition is based on finite models. Using intersection types, we generalize the notions of automata for strings and trees so as to grasp recognizability for λ-terms. We then expose the closure properties of this notion and present some of its applications.
dc.language.isoen
dc.title.enRecognizability in the Simply Typed Lambda-Calculus
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Informatique et langage [cs.CL]
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.title16th Workshop on Logic, Language, Information and Computation
bordeaux.countryJP
bordeaux.conference.cityTokyo
bordeaux.peerReviewedoui
hal.identifierinria-00412654
hal.version1
hal.invitedoui
hal.proceedingsoui
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00412654v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2009&rft.au=SALVATI,%20Sylvain&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem