54 papers:
FoSSaCS-2015-Jaber #game studies #semantics- Operational Nominal Game Semantics (GJ), pp. 264–278.
ICALP-v2-2015-KozenMP0 #algebra- Nominal Kleene Coalgebra (DK, KM, DP, AS), pp. 286–298.
GaM-2015-HochMS #graph #programming- Dynamic Programming on Nominal Graphs (NH, UM, MS), pp. 80–96.
ECOOP-2015-JonesHN #type system- Brand Objects for Nominal Typing (TJ, MH, JN), pp. 198–221.
SAC-2015-Buday #formal method- Formalising the SECD machine with nominal Isabelle (GB), pp. 1823–1824.
CSL-2015-GabbayGP- Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes (MJG, DRG, DP), pp. 374–389.
RTA-2015-BaumgartnerKLV #anti- Nominal Anti-Unification (AB, TK, JL, MV), pp. 57–73.
- RTA-2015-SuzukiKAT #confluence #orthogonal #revisited #term rewriting
- Confluence of Orthogonal Nominal Rewriting Systems Revisited (TS, KK, TA, YT), pp. 301–317.
TLCA-2015-FairweatherFST #dependent type- Dependent Types for Nominal Terms with Atom Substitutions (EF, MF, NS, AT), pp. 180–195.
- FoSSaCS-2014-MurawskiT #exception #game studies #semantics
- Game Semantics for Nominal Exceptions (ASM, NT), pp. 164–179.
KR-2014-KrotzschR #logic- Nominal Schemas in Description Logics: Complexities Clarified (MK, SR).
- FoSSaCS-2013-Clouston #abstraction #set
- Generalised Name Abstraction for Nominal Sets (RC), pp. 434–449.
CIAA-2013-DeganoFM #model checking #towards- Towards Nominal Context-Free Model-Checking (PD, GLF, GM), pp. 109–121.
POPL-2013-LoschP #abstraction- Full abstraction for nominal Scott domains (SL, AMP), pp. 3–14.
- RTA-2013-Calves #unification
- Unifying Nominal Unification (CC), pp. 143–157.
- FoSSaCS-2012-KurzST #on the #regular expression
- On Nominal Regular Languages with Binders (AK, TS, ET), pp. 255–269.
- CIAA-2012-DeganoFM #automaton #resource management
- Nominal Automata for Resource Usage Control (PD, GLF, GM), pp. 125–137.
- ICALP-v2-2012-FernandezR #term rewriting
- Nominal Completion for Rewrite Systems with Binders (MF, AR), pp. 201–213.
- KR-2012-KazakovKS #logic #product line #reasoning
- Practical Reasoning with Nominals in the EL Family of Description Logics (YK, MK, FS).
- POPL-2012-BojanczykBKL #towards
- Towards nominal computation (MB, LB, BK, SL), pp. 401–412.
ESOP-2011-MurawskiT #algorithm #game studies #semantics- Algorithmic Nominal Game Semantics (ASM, NT), pp. 419–438.
- ESOP-2011-UrbanK
- General Bindings and α-Equivalence in Nominal Isabelle (CU, CK), pp. 480–500.
CIKM-2011-WangCWLWO #learning #similarity- Coupled nominal similarity in unsupervised learning (CW, LC, MW, JL, WW, YO), pp. 973–978.
LOPSTR-2010-CalvesF #first-order- The First-Order Nominal Link (CC, MF), pp. 234–248.
PPDP-2010-DowekG #logic- Permissive-nominal logic (GD, MJG), pp. 165–176.
- PPDP-2010-Gacek #higher-order #specification #syntax
- Relating nominal and higher-order abstract syntax specifications (AG), pp. 177–186.
- POPL-2010-Pitts
- Nominal system T (AMP), pp. 159–170.
- RTA-2010-LevyV #algorithm #performance #unification
- An Efficient Nominal Unification Algorithm (JL, MV), pp. 209–226.
- CSL-2009-TurnerW #concurrent
- Nominal Domain Theory for Concurrency (DT, GW), pp. 546–560.
LICS-2009-BengtsonJPV #calculus #logic #mobile #named #process- Psi-calculi: Mobile Processes, Nominal Data, and Logic (JB, MJ, JP, BV), pp. 39–48.
VLDB-2008-WongFPHWL #performance #query- Efficient skyline querying with variable user preferences on nominal attributes (RCWW, AWCF, JP, YSH, TW, YL), pp. 1032–1043.
ICPR-2008-WatanabeK #locality #multi- Locality preserving multi-nominal logistic regression (KW, TK), pp. 1–4.
- ECOOP-2008-MalayeriA #type system
- Integrating Nominal and Structural Subtyping (DM, JA), pp. 260–284.
- RTA-2008-LevyV #higher-order #perspective #unification
- Nominal Unification from a Higher-Order Perspective (JL, MV), pp. 246–260.
- FoSSaCS-2007-BengtsonP #formal method #logic #using #π-calculus
- Formalising the π-Calculus Using Nominal Logic (JB, JP), pp. 63–77.
- LICS-2007-Tzevelekos #abstraction
- Full abstraction for nominal general references (NT), pp. 399–410.
- KR-2006-SirinGP #logic #optimisation #reasoning
- From Wine to Water: Optimizing Description Logic Reasoning for Nominals (ES, BCG, BP), pp. 90–99.
ICLP-2006-Cheney #logic programming #semantics #source code- The Semantics of Nominal Logic Programs (JC), pp. 361–375.
IJCAR-2006-UrbanB #combinator #data type #higher-order #recursion- A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL (CU, SB), pp. 498–512.
- FoSSaCS-2005-Cheney #logic #proving
- A Simpler Proof Theory for Nominal Logic (JC), pp. 379–394.
- FoSSaCS-2005-FerrariMT #calculus #model checking
- Model Checking for Nominal Calculi (GLF, UM, ET), pp. 1–24.
ICML-2005-RayP- Generalized skewing for functions with continuous and nominal attributes (SR, DP), pp. 705–712.
- PPDP-2005-FernandezG #abstraction #generative #locality
- Nominal rewriting with name generation: abstraction vs. locality (MF, MG), pp. 47–58.
- SAC-2005-RahalRPNPRV #biology #incremental #interactive #mining
- Incremental interactive mining of constrained association rules from biological annotation data with nominal features (IR, DR, AP, HN, WP, RR, WVG), pp. 123–127.
CADE-2005-UrbanT #higher-order- Nominal Techniques in Isabelle/HOL (CU, CT), pp. 38–53.
- TLCA-2005-BentonL #reasoning #relational #semantics
- Relational Reasoning in a Nominal Semantics for Storage (NB, BL), pp. 86–101.
- ECOOP-2004-FindlerFF #contract #semantics #type system
- Semantic Casts: Contracts and Structural Subtyping in a Nominal World (RBF, MF, MF), pp. 364–388.
- PPDP-2004-FernandezGM #term rewriting
- Nominal rewriting systems (MF, MG, IM), pp. 108–119.
- LICS-2004-AbramskyGMOS #abstraction #calculus #game studies
- Nominal Games and Full Abstraction for the Nu-Calculus (SA, DRG, ASM, CHLO, IDBS), pp. 150–159.
- LICS-2004-GabbayC #calculus #logic
- A Sequent Calculus for Nominal Logic (MG, JC), pp. 139–148.
- ECOOP-2003-OderskyCRZ #dependent type
- A Nominal Theory of Objects with Dependent Types (MO, VC, CR, MZ), pp. 201–224.
- CSL-2003-UrbanPG
- Nominal Unificaiton (CU, AMP, MG), pp. 513–527.
- ICALP-2001-HonsellMS #algebra #approach #axiom
- An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS (FH, MM, IS), pp. 963–978.
DATE-2000-SchwenckerSGA #automation #bound #design- The Generalized Boundary Curve-A Common Method for Automatic Nominal Design and Design Centering of Analog Circuits (RS, FS, HEG, KA), pp. 42–47.
