Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "lambda-calculus" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    Static and dynamic vector semantics for lambda calculus models of natural language
    Autorzy:
    Sadrzadeh, M.
    Muskens, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/103859.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
    Tematy:
    simple typed lambda calculus
    vector semantic
    composition
    context update potential
    dynamic logic
    Opis:
    Vector models of language are based on contextual aspects of language – distributions of words and how they co-occur in text. Truth conditional models focus on logical aspects of language and on how words combine to contribute to these aspects. In the truth conditional approach, there is a focus on the denotations of phrases. In vector models, the degree of co-occurrence of words in context determines how similar their meanings are. The two approaches have complementary virtues. In this paper we combine them and develop a vector semantics for language, based on the typed lambda calculus. We provide two types of vector semantics: a static one using techniques from the truth conditional tradition, and a dynamic one with a form of interpretation inspired by Heim’s context change potentials. We show, with examples, how the dynamic model can be applied to entailment between a corpus and a sentence.
    Źródło:
    Journal of Language Modelling; 2018, 6, 2; 319-351
    2299-856X
    2299-8470
    Pojawia się w:
    Journal of Language Modelling
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Polyadic algebras over nonclassical logics
    Autorzy:
    Pigozzi, Don
    Salibra, Antonino
    Powiązania:
    https://bibliotekanauki.pl/articles/1361079.pdf
    Data publikacji:
    1993
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Tematy:
    lambda calculus
    modal logic
    intuitionistic logic
    many-valued logic
    BCK logic
    Opis:
    The polyadic algebras that arise from the algebraization of the first-order extensions of a SIC are characterized and a representation theorem is proved. Standard implicational calculi (SIC)'s were considered by H. Rasiowa [19] and include classical and intuitionistic logic and their various weakenings and fragments, the many-valued logics of Post and Łukasiewicz, modal logics that admit the rule of necessitation, BCK logic, etc.
    Źródło:
    Banach Center Publications; 1993, 28, 1; 51-66
    0137-6934
    Pojawia się w:
    Banach Center Publications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Theory of an Arbitrary Higher λ-Model
    Autorzy:
    Martínez-Rivillas, Daniel O.
    de Queiroz, Ruy J. G. B.
    Powiązania:
    https://bibliotekanauki.pl/articles/43180151.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
    Tematy:
    higher lambda calculus
    homotopic lambda model
    Kan complex reflexive
    higher conversion
    homotopy type-free theory
    Opis:
    One takes advantage of some basic properties of every homotopic λ-model (e.g. extensional Kan complex) to explore the higher βη-conversions, which would correspond to proofs of equality between terms of a theory of equality of any extensional Kan complex. Besides, Identity types based on computational paths are adapted to a type-free theory with higher λ-terms, whose equality rules would be contained in the theory of any λ-homotopic model.
    Źródło:
    Bulletin of the Section of Logic; 2023, 52, 1; 39-58
    0138-0680
    2449-836X
    Pojawia się w:
    Bulletin of the Section of Logic
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Strong Normalization of a Typed Lambda Calculus for Intuitionistic Bounded Linear-time Temporal Logic
    Autorzy:
    Kamide, Norihiro
    Powiązania:
    https://bibliotekanauki.pl/articles/1368573.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
    Opis:
    Linear-time temporal logics (LTLs) are known to be useful for verifying concurrent systems, and a simple natural deduction framework for LTLs has been required to obtain a good computational interpretation. In this paper, a typed $\lambda$-calculus $\lambda_{B[l]}$ with a Curry-Howard correspondence is introduced for an intuitionistic bounded linear-time temporal logic $B[l]$, of which the time domain is bounded by a fixed positive integer $l$. The strong normalization theorem for $\lambda_{B[l]}$ is proved as a main result. The base logic $B[l]$ is defined as a Gentzen-type sequent calculus, and despite the restriction on the time domain, $B[l]$ can derive almost all the typical temporal axioms of LTLs. The proposed frame-work allows us to obtain a uniform and simple proof-theoretical treatment of both natural deduction and sequent calculus, i.e., the equivalence between them, the cut-elimination theorem, the decidability theorem, the Curry-Howard correspondence and the strong normalization theorem can be obtained uniformly.
    Źródło:
    Reports on Mathematical Logic; 2012, 47; 29-61
    0137-2904
    2084-2589
    Pojawia się w:
    Reports on Mathematical Logic
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Elementary Proof of Strong Normalization for Atomic F
    Autorzy:
    Ferreira, Fernando
    Ferreira, Gilda
    Powiązania:
    https://bibliotekanauki.pl/articles/749972.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
    Tematy:
    Predicative polymorphism
    strong normalization
    elementary proofs
    lambda-calculus
    Opis:
    We give an elementary proof (in the sense that it is formalizable in Peano arithmetic) of the strong normalization of the atomic polymorphic calculus Fat (a predicative restriction of Girard’s system F).
    Źródło:
    Bulletin of the Section of Logic; 2016, 45, 1
    0138-0680
    2449-836X
    Pojawia się w:
    Bulletin of the Section of Logic
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An outline of type-theoretical approaches to lexical semantics
    Autorzy:
    Cooper, R.
    Retoré, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/103831.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
    Tematy:
    lexical semantics
    compositional semantics
    type theory
    lambda calculus
    Opis:
    We take the opportunity of the publication of some of the papers of the ESSLLI workshop TYTLES (TYpe Theory and LExical Semantics, ESSLLI 2015, Barcelona) to provide an overview of the possibilities that type theory offers to model lexical semantics, especially the type-theoretical frameworks that properly model compositional semantics.
    Źródło:
    Journal of Language Modelling; 2017, 5, 2; 165-178
    2299-856X
    2299-8470
    Pojawia się w:
    Journal of Language Modelling
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A logical approach to grammar description
    Autorzy:
    Clément, L.
    Kirman, J.
    Salvati, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/103895.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
    Tematy:
    grammar description
    logic
    Finite State Automata
    logical transduction
    lambda calculus
    Abstract Categorial Grammars
    Opis:
    In the tradition of Model Theoretic Syntax, we propose a logical approach to the description of grammars. We combine in one formalism several tools that are used throughout computer science for their power of abstraction: logic and lambda calculus. We propose then a high-level formalism for describing mildly context sensitive grammars and their semantic interpretation. As we rely on the correspondence between logic and finite state automata, our method combines conciseness with effectivity. We illustrate our approach with a simple linguistic model of several interleaved linguistic phenomena involving extraction. The level of abstraction provided by logic and lambda calculus allows us not only to use this linguistic model for several languages, namely English, German, and Dutch, but also for semantic interpretation.
    Źródło:
    Journal of Language Modelling; 2015, 3, 1; 87-143
    2299-856X
    2299-8470
    Pojawia się w:
    Journal of Language Modelling
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies