13 papers:
ESOP-2009-StricklandTF #morphism #polymorphism- Practical Variable-Arity Polymorphism (TSS, STH, MF), pp. 32–46.
KR-2004-EiterFFPW #bound #complexity #model checking #programming #set- Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming (TE, WF, MF, GP, SW), pp. 377–387.
CADE-2003-Schmidt-Schauss #bound #decidability #higher-order- Decidability of Arity-Bounded Higher-Order Matching (MSS), pp. 488–502.
ICFP-1998-HannanH #higher-order- Higher-Order Arity Raising (JH, PH), pp. 27–38.
CSL-1996-Imhof #aspect-oriented- Computational Aspects of Arity Hierarchies (HI), pp. 211–225.
PODS-1994-Afrati #bound #datalog #exclamation #graph #query- Bounded Arity Datalog (!=) Queries on Graphs (FNA), pp. 97–106.
LFP-1994-DzengH #re-engineering- Type Reconstruction for Variable-Arity Procedures (HD, CTH), pp. 239–249.
- CSL-1993-Grohe #bound #fixpoint #logic
- Bounded-Arity Hierarchies in Fixed-Point Logics (MG), pp. 150–164.
ICLP-1991-ChenW #abstraction #logic #multi #set- An Intensional Logic of (Multi-Arity) Set Abstractions (WC, DSW), pp. 97–110.
- ESOP-1990-Romanenko
- Arity Raiser and its Use in Program Specialization (SAR), pp. 341–360.
- PODS-1989-DublishM #bound #fixpoint #query
- Expressibility of Bounded-Arity Fixed-Point Query Hierarchies (PD, SNM), pp. 324–335.
- LFP-1988-DybvigH #interface
- A Variable-Arity Procedural Interface (RKD, RH), pp. 106–115.
FPCA-1987-BellotJ #implementation- A theory for natural modelisation and implementation of functions with variable arity (PB, VJ), pp. 212–233.
