Result 1 to 20 of 74 total
PNL to HOL: from the logic of nominal sets to the logic of higher-order functions. (English)
Theor. Comput. Sci. 451, 38-69 (2012).
1
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free. (English)
J. Symb. Log. 77, No. 3, 828-852 (2012).
2
Corrigendum to “Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms”. (English)
Inf. Comput. 212, 119 (2012).
3
Unity in nominal equational reasoning: the algebra of equality on nominal sets. (English)
J. Appl. Log. 10, No. 2, 199-217 (2012).
4
Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables. (English)
Math. Struct. Comput. Sci. 21, No. 5, 997-1033 (2011).
5
Multi-task regularization of generative similarity models. (English)
Pelillo, Marcello (ed.) et al., Similarity-based pattern recognition. First international workshop, SIMBAD 2011, Venice, Italy, September 28‒30, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24470-4/pbk). Lecture Notes in Computer Science 7005, 90-103 (2011).
6
Stone duality for nominal Boolean algebras with {\cyr{I}}. (English)
Corradini, Andrea (ed.) et al., Algebra and coalgebra in computer science. 4th international conference, CALCO 2011, Winchester, UK, August 30‒September 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22943-5/pbk). Lecture Notes in Computer Science 6859, 192-207 (2011).
7
Principal types for nominal theories. (English)
Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 160-172 (2011).
8
A proof-theoretic treatment of $λ$-reduction with cut-elimination: $λ$-calculus as a logic programming language. (English)
J. Symb. Log. 76, No. 2, 673-699 (2011).
9
Foundations of nominal techniques: logic and semantics of variables in abstract syntax. (English)
Bull. Symb. Log. 17, No. 2, 161-229 (2011).
10
Freshness and name-restriction in sets of traces with names. (English)
Hofmann, Martin (ed.), Foundations of software science and computational structures. 14th international conference, FOSSACS 2011, held as part of the joint European conferences on theory and practice of software, ETAPS 2011, Saarbrücken, Germany, March 26 ‒ April 3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19804-5/pbk). Lecture Notes in Computer Science 6604, 365-380 (2011).
11
A proof-theoretic treatment of $λ$-reduction with cut-elimination: $λ$-calculus as a logic programming language (English)
J. Symb. Log. 76, No. 2, 673-699 (2011).
12
Foundations of nominal techniques: logic and semantics of variables in abstract syntax (English)
Bulletin of Symbolic Logic 17, No. 2, 161-229 (2011).
13
Nominal henkin semantics: simply-typed lambda-calculus models in nominal sets (English)
LFMTP, 58-75 (2011).
14
Multi-task regularization of generative similarity models (English)
SIMBAD, 90-103 (2011).
15
Principal types for nominal theories (English)
FCT, 160-172 (2011).
16
Stone duality for nominal Boolean algebras with \? (English)
CALCO, 192-207 (2011).
17
Freshness and name-restriction in sets of traces with names (English)
FOSSACS, 365-380 (2011).
18
A simple class of Kripke-style models in which logic and computation have equal standing. (English)
Clarke, Edmund M. (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 16th international conference, LPAR-16, Dakar, Senegal, April 25 ‒ May 1, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-17510-7/pbk). Lecture Notes in Computer Science 6355. Lecture Notes in Artificial Intelligence, 231-254 (2010).
19
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques. (English)
Log. J. IGPL 18, No. 6, 769-822 (2010).
20
Result 1 to 20 of 74 total
Start
Contact
Print
General Help
