Zobrazeno 1 - 10 of 42 pro vyhledávání: '"Capretta, V."'
1
Reflection in the chomsky hierarchy
Autor: Barendregt, H.P., Capretta, V., Kozen, D.C.
Publikováno v: Journal of Automata, Languages and Combinatorics, 18, 53-60
Journal of Automata, Languages and Combinatorics, 18, 1, pp. 53-60
Contains fulltext : 122966.pdf (Publisher’s version ) (Closed access)
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c1a1d909935a9d12b1cb63eebd747fcd
https://hdl.handle.net/2066/122966
Zobrazit plný text záznamu
2
Strictness Analysis via Resource Typing
Autor: Barendsen, E., Smetsers, J.E.W., E., Barendsen, Capretta, V., Geuvers, H., Niqui, M.
Publikováno v: E., Barendsen; Capretta, V.; Geuvers, H. (ed.), Reflections on Type Theory, lambda-Calculus, and the Mind: Essays dedicated to Henk Barendregt on the occasion of his 60th birthday, pp. 29-40
E., Barendsen; Capretta, V.; Geuvers, H. (ed.), Reflections on Type Theory, lambda-Calculus, and the Mind: Essays dedicated to Henk Barendregt on the occasion of his 60th birthday, 29-40. Nijmegen : Radboud University Nijmegen
STARTPAGE=29;ENDPAGE=40;TITLE=E., Barendsen; Capretta, V.; Geuvers, H. (ed.), Reflections on Type Theory, lambda-Calculus, and the Mind: Essays dedicated to Henk Barendregt on the occasion of his 60th birthday
Contains fulltext : 36506.pdf (Author’s version preprint ) (Open Access)
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::aff68841e607b81576e3488d8500195c
https://hdl.handle.net/2066/36506
Zobrazit plný text záznamu
3
Reflection in the Chomsky Hierarchy
Autor: Barendregt, H., Capretta, V., Kozen, D.C.
Publikováno v: Technical Report. Ithaca, NY : Computing and Information Science, Cornell University
Technical Report
The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb60034619debe504437e838d57c3155
https://hdl.handle.net/2066/103686
Zobrazit plný text záznamu
4
A Type of Partial Recursive Functions
Autor: Bove, Ana, Capretta, V., Mohamed, Otmane Aït, Muñoz, César, Tahar, Sofiène
Publikováno v: Mohamed, Otmane Aït; Muñoz, César; Tahar, Sofiène (ed.), Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings, pp. 102-117
Mohamed, Otmane Aït; Muñoz, César; Tahar, Sofiène (ed.), Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings, 102-117. Berlin : Springer
STARTPAGE=102;ENDPAGE=117;ISSN=0302-9743;TITLE=Mohamed, Otmane Aït; Muñoz, César; Tahar, Sofiène (ed.), Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings
Item does not contain fulltext Theorem Proving in Higher Order Logics, 21st International Conference TPHOLs 2008, 18 augustus 2008
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b63625d293d5955cd1d1ca6a54731e53
https://hdl.handle.net/2066/72722
Zobrazit plný text záznamu
5
Lambda Calculus for Engineers
Autor: Hartel, Pieter H., Vree, W.G., Barendsen, E., Capretta, V., Geuvers, H., Niqui, M.
Publikováno v: Reflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday, 125-138
STARTPAGE=125;ENDPAGE=138;TITLE=Reflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday
In pure functional programming it is awkward to use a stateful sub-computation in a predominantly stateless computation. The problem is that the state of the subcomputation has to be passed around using ugly plumbing. Classical examples of the plumbi
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::e92ce93a88469f072add120dc0d957b4
https://research.utwente.nl/en/publications/lambda-calculus-for-engineers(6fe4075e-8c3c-40d4-b253-b99925bace8c).html
Zobrazit plný text záznamu
6
Binary Relations as a Foundation of Mathematics
Autor: Kuper, Jan, Barendsen, E., Capretta, V., Geuvers, H., Niqui, M.
Publikováno v: Reflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday, 223-232
STARTPAGE=223;ENDPAGE=232;TITLE=Reflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday
We describe a theory for binary relations in the Zermelo-Fraenkel style. We choose for ZFCU, a variant of ZFC Set theory in which the Axiom of Foundation is replaced by an axiom allowing for non-wellfounded sets. The theory of binary relations is sho
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::62806bae25d160837c8901caf5f1c687
https://research.utwente.nl/en/publications/binary-relations-as-a-foundation-of-mathematics(2be94b94-6c9a-47c7-81ff-cf371f4eaad1).html
Zobrazit plný text záznamu
9
The logic and mathematics of occasion sentences
Autor: Seuren, P.A.M., Capretta, V., Geuvers, J.H.
Publikováno v: Linguistics & Philosophy
Linguistics and Philosophy, 24(5), 531-595. Springer
The prime purpose of this paper is, first, to restore to discourse-bound occasion sentences their rightful central place in semantics and secondly, taking these as the basic propositional elements in the logical analysis of language, to contribute to
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c530172b6e91ef71a81752f68ea1cb79
https://hdl.handle.net/11858/00-001M-0000-002D-4C2A-711858/00-001M-0000-002D-4C28-B
Zobrazit plný text záznamu
10
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje