Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Jean-Philippe Bernardy"'
Autor:
Jean-Philippe Bernardy, Patrik Jansson
Publikováno v:
Logical Methods in Computer Science, Vol Volume 12, Issue 2 (2016)
Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose. In this paper, we present an algebraic specification, implementation, and
Externí odkaz:
https://doaj.org/article/44a5cf95b22c4995b147920104ec09a1
Autor:
Julian Grove, Jean-Philippe Bernardy
Publikováno v:
Journal of Logic, Language and Information. 32:219-245
Research in dynamic semantics has made strides by studying various aspects of discourse in terms of computational effect systems, for example, monads (Shan, 2002; Charlow, 2014), Barker and 2014), (Maršik, 2016). We provide a system, based on graded
Autor:
Jean-Philippe Bernardy, Shalom Lappin
Publikováno v:
Algebraic Structures in Natural Language ISBN: 9781003205388
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::020d8db577e1c4bfe3ab70eb26a03c38
https://doi.org/10.1201/9781003205388-11
https://doi.org/10.1201/9781003205388-11
Publikováno v:
Journal of Logic, Language and Information. 30:1-29
In this paper, we propose a framework capable of dealing with anaphora and ellipsis which is both general and algorithmic. This generality is ensured by the compination of two general ideas. First, we use a dynamic semantics which reperent effects us
Autor:
Jean-Philippe Bernardy, Andreas Abel
Publikováno v:
Proceedings of the ACM on Programming Languages. 4:1-28
We propose to unify the treatment of a broad range of modalities in typed lambda calculi. We do so by defining a generic structure of modalities, and show that this structure arises naturally from the structure of intuitionistic logic, and as such fi
Autor:
Jean-Philippe Bernardy, Shalom Lappin
We show that both an LSTM and a unitary-evolution recurrent neural network (URN) can achieve encouraging accuracy on two types of syntactic patterns: context-free long distance agreement, and mildly context-sensitive cross serial dependencies. This w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98a951f758b0b1a0961bd9196f18ef82
Autor:
Shalom Lappin, Jean-Philippe Bernardy
Publikováno v:
Proceedings of the Workshop on Cognitive Modeling and Computational Linguistics.
Autor:
Jean-Philippe Bernardy, Arnaud Spiwack
Publikováno v:
Haskell
A number of domain specific languages, such as circuits or data-science workflows, are best expressed as diagrams of boxes connected by wires. Unfortunately, functional languages have traditionally been ill-equipped to embed this sort of languages. T
Publikováno v:
CSF
IEEE 34th Computer Security Foundations Symposium (CSF)
2021 IEEE 34th Computer Security Foundations Symposium (CSF)
IEEE 34th Computer Security Foundations Symposium (CSF)
2021 IEEE 34th Computer Security Foundations Symposium (CSF)
We show that noninterference and transparency, the key soundness theorems for dynamic IFC libraries, can be obtained "for free", as direct consequences of the more general parametricity theorem of type abstraction. This allows us to give very short s