BibSLEIGH — recursion tag

recursion

recursion

Tag #recursion

702 papers:

POPL-2020-XiaZHHMPZ #coq #interactive #representation #source code: Interaction trees: representing recursive and impure programs in Coq (LyX, YZ, PH, CKH, GM, BCP, SZ), p. 32.
CGO-2020-JavanmardAKPCH #algorithm #compilation #divide and conquer #multi #parametricity #programming #using: Deriving parametric multi-way recursive divide-and-conquer dynamic programming algorithms using polyhedral compilers (MMJ, ZA, MK, LNP, RC, RJH), pp. 317–329.
SANER-2019-BuchA #abstract syntax tree #clone detection #detection #syntax: Learning-Based Recursive Aggregation of Abstract Syntax Trees for Code Clone Detection (LB, AA0), pp. 95–104.
FSCD-2019-Naurois #pointer: Pointers in Recursion: Exploring the Tropics (PJdN), p. 18.
FSCD-2019-VeltriW: Guarded Recursion in Agda via Sized Types (NV, NvdW), p. 19.
ICFP-2019-LindenhoviusMZ #linear: Mixed linear and non-linear recursive types (BL, MWM, VZ), p. 29.
ECIR-p1-2019-MackenzieMPCS #graph: Compressing Inverted Indexes with Recursive Graph Bisection: A Reproducibility Study (JM, AM, MP, JSC, TS), pp. 339–352.
ICML-2019-GhaziPW #composition #learning #sketching: Recursive Sketches for Modular Deep Learning (BG, RP, JRW), pp. 2211–2220.
ICML-2019-KingmaAH #named: Bit-Swap: Recursive Bits-Back Coding for Lossless Compression with Hierarchical Latent Variables (FHK, PA, JH), pp. 3408–3417.
KDD-2019-YangRLC #graph #named #sketching: NodeSketch: Highly-Efficient Graph Embeddings via Recursive Sketching (DY, PR, BL, PCM), pp. 1162–1172.
PEPM-2019-YallopK #generative: Generating mutually recursive definitions (JY, OK), pp. 75–81.
PLDI-2019-Sundararajah0 #composition: Composable, sound transformations of nested recursion and loops (KS, MK0), pp. 902–917.
POPL-2019-MogelbergV #bisimulation: Bisimulation as path type for guarded recursive types (REM, NV), p. 29.
CASE-2019-AndersonlPL #estimation #mobile #using: Mobile Robotic Radiation Surveying Using Recursive Bayesian Estimation (RBA, MP, SL), pp. 1187–1192.
CASE-2019-BaeM #equivalence #queue: Exit Time Recursions, Recording Principles, and Queue Equivalence in Generalized Regular Flow Lines (SYB, JRM), pp. 922–929.
CASE-2019-BenevidesIPT #robust: ROS-Based Robust and Recursive Optimal Control of Commercial Quadrotors (JRSB, RSI, MADP, MHT), pp. 998–1003.
ESOP-2019-Alvarez-Picallo #datalog #fixpoint #incremental #semantics: Fixing Incremental Computation - Derivatives of Fixpoints, and the Recursive Semantics of Datalog (MAP, AET, MPJ, CHLO), pp. 525–552.
ESOP-2019-BasoldKL #horn clause #induction #proving: Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses (HB, EK, YL), pp. 783–813.
SANER-2018-LeemansAB #analysis #modelling: Recursion aware modeling and discovery for hierarchical software event log analysis (ML, WMPvdA, MGJvdB), pp. 185–196.
ICFP-2018-WandCGC #equivalence #probability #random: Contextual equivalence for a probabilistic language with continuous random variables and recursion (MW, RC, TG, AC), p. 30.
ICML-2018-KajiharaKYF #estimation #kernel: Kernel Recursive ABC: Point Estimation with Intractable Likelihood (TK, MK, KY, KF), pp. 2405–2414.
ICML-2018-KasaiSM #algorithm #analysis #convergence #probability: Riemannian Stochastic Recursive Gradient Algorithm with Retraction and Vector Transport and Its Convergence Analysis (HK, HS, BM), pp. 2521–2529.
ICPR-2018-ChengLYT #image #named #network: SESR: Single Image Super Resolution with Recursive Squeeze and Excitation Networks (XC, XL0, JY0, YT), pp. 147–152.
ICPR-2018-JiangWYSLGFZ #network: Recursive Inception Network for Super-Resolution (TJ, XW, ZY, WS, GL, SG, HF, QZ), pp. 2759–2764.
KDD-2018-TuCWY0 #equivalence #network: Deep Recursive Network Embedding with Regular Equivalence (KT, PC0, XW0, PSY, WZ0), pp. 2357–2366.
PEPM-2018-Jay #normalisation #source code: Recursive programs in normal form (short paper) (BJ), pp. 67–73.
POPL-2018-ClairambaultGM #higher-order: Linearity in higher-order recursion schemes (PC, CG, ASM), p. 29.
CASE-2018-VijayaraghavanK #evaluation #integer #linear #programming #reduction #reliability: A Mixed Integer Programming Based Recursive Variance Reduction Method for Reliability Evaluation of Linear Sensor Systems (VV, KK, YD, HP), pp. 836–842.
CSL-2018-DasO #polynomial: A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions (AD0, IO), p. 17.
FSCD-2017-SuzukiF0T #automaton #higher-order #model checking: Streett Automata Model Checking of Higher-Order Recursion Schemes (RS0, KF, NK0, TT), p. 18.
CIKM-2017-XuWXQ #classification #graph #network: Attentive Graph-based Recursive Neural Network for Collective Vertex Classification (QX, QW, CX, LQ), pp. 2403–2406.
ICML-2017-Kallus #clustering #personalisation #using: Recursive Partitioning for Personalization using Observational Data (NK), pp. 1789–1798.
ICML-2017-NguyenLST #machine learning #named #novel #probability #problem #using: SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient (LMN, JL, KS, MT), pp. 2613–2621.
ECOOP-2017-MayerHK #string #synthesis: Proactive Synthesis of Recursive Tree-to-String Functions from Examples (MM, JH, VK), p. 30.
OOPSLA-2017-SakkaS0 #framework #named #traversal: TreeFuser: a framework for analyzing and fusing general recursive tree traversals (LS, KS, MK0), p. 30.
PLDI-2017-LifflanderK #locality #optimisation #source code: Cache locality optimization for recursive programs (JL, SK), pp. 1–16.
POPL-2017-KobayashiLB #fixpoint #higher-order #logic #on the: On the relationship between higher-order recursion schemes and higher-order fixpoint logic (NK0, ÉL, FB), pp. 246–259.
ASPLOS-2017-SundararajahSK #locality: Locality Transformations for Nested Recursive Iteration Spaces (KS, LS, MK0), pp. 281–295.
ESOP-2017-BlanchetteBL0T #implementation #proving: Friends with Benefits - Implementing Corecursion in Foundational Proof Assistants (JCB, AB, AL, AP0, DT), pp. 111–140.
ESOP-2017-ChatterjeeKMP #algorithm #performance #state machine: Faster Algorithms for Weighted Recursive State Machines (KC, BK, SM, AP), pp. 287–313.
CAV-2017-ChatterjeeFG #analysis #source code #worst-case: Non-polynomial Worst-Case Analysis of Recursive Programs (KC, HF0, AKG), pp. 41–63.
CAV-2017-TrinhCJ #string: Model Counting for Recursively-Defined Strings (MTT, DHC, JJ), pp. 399–418.
CSL-2017-EscardoK #type system: Partial Elements and Recursion via Dominances in Univalent Type Theory (MHE, CMK), p. 16.
VMCAI-2017-HahnST0 #algorithm #game studies: Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (EMH, SS, AT, LZ0), pp. 266–287.
FM-2016-StrichmanV #verification: Regression Verification for Unbalanced Recursive Functions (OS, MV), pp. 645–658.
Haskell-2016-MokhovMJM #harmful #scalability: Non-recursive make considered harmful: build systems at scale (AM, NM, SPJ, SM), pp. 170–181.
ICFP-2016-LindleyM: Talking bananas: structural recursion for session types (SL, JGM), pp. 434–447.
KDD-2016-DhulipalaKKOPS #graph: Compressing Graphs and Indexes with Recursive Graph Bisection (LD, IK, BK, GO, SP, AS), pp. 1535–1544.
LOPSTR-2016-FarkaKH #induction: Coinductive Soundness of Corecursive Type Class Resolution (FF, EK, KH), pp. 311–327.
LOPSTR-2016-Schmidt-Schauss #higher-order #unification: Nominal Unification of Higher Order Expressions with Recursive Let (MSS, TK, JL, MV), pp. 328–344.
POPL-2016-CaiGO #data type #programming: System f-omega with equirecursive types for datatype-generic programming (YC, PGG, KO), pp. 30–43.
POPL-2016-MuroyaHH #geometry #interactive: Memoryful geometry of interaction II: recursion and adequacy (KM, NH, IH), pp. 748–760.
POPL-2016-RobbinsKS #data type #decompiler #semantics: From MinX to MinC: semantics-driven decompilation of recursive datatypes (ER, AK, TS), pp. 191–203.
PPDP-2016-Schmidt-Schauss #unification: Unification of program expressions with recursive bindings (MSS, DS), pp. 160–173.
CC-2016-RajbhandariKKPR #on the #traversal: On fusing recursive traversals of K-d trees (SR, JK, SK, LNP, FR, RJH, PS), pp. 152–162.
CAV-2016-TrinhCJ #reasoning #string: Progressive Reasoning over Recursively-Defined Strings (MTT, DHC, JJ), pp. 218–240.
CSL-2016-BirkedalBCGSV #similarity #type system: Guarded Cubical Type Theory: Path Equality for Guarded Recursion (LB, AB, RC, HBG, BS, AV), p. 17.
CSL-2016-Krivine: Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis (JLK), p. 11.
IJCAR-2016-ReynoldsBCT #smt: Model Finding for Recursive Functions in SMT (AR, JCB, SC, CT), pp. 133–151.
VLDB-2015-WangBH #datalog #evaluation #fault tolerance: Asynchronous and Fault-Tolerant Recursive Datalog Evaluation in Shared-Nothing Engines (JW, MB, DH), pp. 1542–1553.
SIGITE-2015-AlZoubiFEGAH #education #hybrid: A Hybrid Model for Teaching Recursion (OA, DF, BDE, NG, MA, RH), pp. 65–70.
LATA-2015-KrishnaMT #automaton #bound #decidability #problem #reachability: Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (SNK, LM, AT), pp. 237–248.
TLCA-2015-Pientka0: Well-Founded Recursion over Contextual Objects (BP, AA), pp. 273–287.
ICFP-2015-Blanchette0T #perspective #proving: Foundational extensible corecursion: a proof assistant perspective (JCB, AP, DT), pp. 192–204.
ICFP-2015-DownenJA: Structures for structural recursion (PD, PJF, ZMA), pp. 127–139.
GCM-2015-Flick #correctness #graph #on the #source code: On Correctness of Graph Programs Relative to Recursively Nested Conditions (NEF), pp. 97–112.
CSCW-2015-KleinMC #collaboration #metric #wiki: The Virtuous Circle of Wikipedia: Recursive Measures of Collaboration Structures (MK, TM, JCIC), pp. 1106–1115.
ICML-2015-ZhuSG #memory management: Long Short-Term Memory Over Recursive Structures (XDZ, PS, HG), pp. 1604–1612.
KDD-2015-WangLSH #approach #composition #interactive #topic #towards: Towards Interactive Construction of Topical Hierarchy: A Recursive Tensor Decomposition Approach (CW, XL, YS, JH), pp. 1225–1234.
PLDI-2015-RenJKAK #execution #hardware #performance #source code: Efficient execution of recursive programs on commodity vector hardware (BR, YJ, SK, KA, MK), pp. 509–520.
POPL-2015-ChatterjeeIPG #algebra #algorithm #constant #performance #state machine: Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.
POPL-2015-HinzeWG #morphism: Conjugate Hylomorphisms — Or: The Mother of All Structured Recursion Schemes (RH, NW, JG), pp. 527–538.
PPDP-2015-Fruhwirth #termination: A devil’s advocate against termination of direct recursion (TWF), pp. 103–113.
ASPLOS-2015-FletcherRKDD #ram #verification: Freecursive ORAM: [Nearly] Free Recursion and Integrity Verification for Position-based Oblivious RAM (CWF, LR, AK, MvD, SD), pp. 103–116.
PPoPP-2015-TangYKTGC #algorithm #parallel #programming: Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency (YT, RY, HK, JJT, PG, RAC), pp. 205–214.
ESOP-2015-Chugh #named #self #type system: IsoLATE: A Type System for Self-recursion (RC), pp. 257–282.
ESOP-2015-VasconcelosJFH #analysis #functional #lazy evaluation #type system: Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages (PBV, SJ, MF, KH), pp. 787–811.
FoSSaCS-2015-CloustonBGB #induction #programming #reasoning: Programming and Reasoning with Guarded Recursion for Coinductive Types (RC, AB, HBG, LB), pp. 407–421.
TACAS-2015-ChenHTWW #contest #named #program transformation #source code #text-to-text #verification: CPArec: Verifying Recursive Programs via Source-to-Source Program Transformation — (Competition Contribution) (YFC, CH, MHT, BYW, FW), pp. 426–428.
TACAS-2015-DanglLW #contest #float #source code: CPAchecker with Support for Recursive Programs and Floating-Point Arithmetic — (Competition Contribution) (MD, SL, PW), pp. 423–425.
TACAS-2015-UnnoT #horn clause: Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling (HU, TT), pp. 149–163.
ICLP-J-2015-AlvianoFG #programming #set: Rewriting recursive aggregates in answer set programming: back to monotonicity (MA, WF, MG), pp. 559–573.
EDM-2014-SunYIS #learning: Alternating Recursive Method for Q-matrix Learning (YS, SY, SI, YS), pp. 14–20.
ICALP-v1-2014-Kuncak #verification: Verifying and Synthesizing Software with Recursive Functions — (Invited Contribution) (VK), pp. 11–25.
ICALP-v2-2014-GoncharovP #algebra #bisimulation #equation #monad: Coalgebraic Weak Bisimulation from Recursive Equations over Monads (SG, DP), pp. 196–207.
SFM-2014-GiachinoL #concurrent #detection #linear #source code: Deadlock Detection in Linear Recursive Programs (EG, CL), pp. 26–64.
ICPR-2014-Martinez-VargasHAAC #component #constraints #probability: Recursive Separation of Stationary Components by Subspace Projection and Stochastic Constraints (JDMV, CCH, AMÁM, CDAM, GCD), pp. 3469–3474.
KR-2014-CeruttiGVZ: An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation (FC, MG, MV, MZ).
PPDP-2014-Ramsay #abstraction #safety: Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes (SJR), pp. 175–186.
SAS-2014-ChenHTWW #source code #using #verification: Verifying Recursive Programs Using Intraprocedural Analyzers (YFC, CH, MHT, BYW, FW), pp. 118–133.
FoSSaCS-2014-Padovani #linear #re-engineering #π-calculus: Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types (LP), pp. 88–102.
CAV-2014-KomuravelliGC #model checking #smt #source code: SMT-Based Model Checking for Recursive Programs (AK, AG, SC), pp. 17–34.
LICS-CSL-2014-Mamouras #hoare #monad #on the: On the Hoare theory of monadic recursion schemes (KM), p. 10.
LICS-CSL-2014-Mogelberg #effectiveness #type system: A type theory for productive coprogramming via guarded recursion (REM), p. 10.
SIGMOD-2013-ChenZ #difference #privacy #strict #towards: Recursive mechanism: towards node differential privacy and unrestricted joins (SC, SZ), pp. 653–664.
SIGITE-2013-Settle #development #exclamation #web: Reaching the “aha!” moment: web development as a motivator for recursion (AS), pp. 69–70.
ICALP-v1-2013-Leonardos #bound #complexity #random: An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (NL), pp. 696–708.
ICALP-v2-2013-ImNP #data type #parametricity: Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types (HI, KN, SP), pp. 299–311.
LATA-2013-Etessami #algorithm #infinity #probability #verification: Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems (KE), p. 12.
LATA-2013-Ong #automaton #higher-order #model checking: Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking (LO), pp. 13–41.
RTA-2013-SmolkaT #unification: Unification Modulo Nonnested Recursion Schemes via Anchored Semi-Unification (GS, TT), pp. 271–286.
TLCA-2013-HancockMGMA #induction: Small Induction Recursion (PH, CM, NG, LM, TA), pp. 156–172.
TLCA-2013-SalvatiW #modelling #using: Using Models to Model-Check Recursive Schemes (SS, IW), pp. 189–204.
ICFP-2013-AbelP #approach #pattern matching #termination: Wellfounded recursion with copatterns: a unified approach to termination and productivity (AA, BP), pp. 185–196.
ICFP-2013-AtkeyM #effectiveness: Productive coprogramming with guarded recursion (RA, CM), pp. 197–208.
ICFP-2013-HidakaAHKN #graph #order #query: Structural recursion for querying ordered graphs (SH, KA, ZH, HK, KN), pp. 305–318.
ICFP-2013-HinzeWG: Unifying structured recursion schemes (RH, NW, JG), pp. 209–220.
IFL-2013-HackettHJ #approach #optimisation #source code: The Under-Performing Unfold: A new approach to optimising corecursive programs (JH, GH, MJ), p. 1.
AIIDE-2013-TomaiSF #game studies: Mimicking Humanlike Movement in Open World Games with Path-Relative Recursive Splines (ET, RS, RF).
CIG-2013-FurtakB #game studies #monte carlo: Recursive Monte Carlo search for imperfect information games (TF, MB), pp. 1–8.
ICML-c3-2013-BellemareVB #learning: Bayesian Learning of Recursively Factored Environments (MGB, JV, MB), pp. 1211–1219.
KDD-2013-GopalY #classification #dependence #scalability #visual notation: Recursive regularization for large-scale classification with hierarchical and graphical dependencies (SG, YY), pp. 257–265.
KDD-2013-WangDDZNTH #framework #mining #topic: A phrase mining framework for recursive construction of a topical hierarchy (CW, MD, ND, YZ, PN, TT, JH), pp. 437–445.
ECOOP-2013-SummersD #abstraction #semantics: A Formal Semantics for Isorecursive and Equirecursive State Abstractions (AJS, SD), pp. 129–153.
OOPSLA-2013-KneussKKS #synthesis: Synthesis modulo recursive functions (EK, IK, VK, PS), pp. 407–426.
PADL-2013-Aranda-LopezNSS #formal method #sql: Formalizing a Broader Recursion Coverage in SQL (GAL, SN, FSP, JSH), pp. 93–108.
PEPM-2013-DevrieseSCP #domain-specific language: Fixing idioms: a recursion primitive for applicative DSLs (DD, IS, DC, FP), pp. 97–106.
PPDP-2013-YamadaKS #order #polynomial: Unifying the Knuth-Bendix, recursive path and polynomial orders (AY, KK, TS), pp. 181–192.
SAC-PL-J-2012-Ancona13 #prolog: Regular corecursion in Prolog (DA), pp. 142–162.
DATE-2013-JongheDDG #modelling: Extracting analytical nonlinear models from analog circuits by recursive vector fitting of transfer function trajectories (DdJ, DD, TD, GGEG), pp. 1448–1453.
ESOP-2013-KobayashiI #higher-order #model checking #source code: Model-Checking Higher-Order Programs with Recursive Types (NK, AI), pp. 431–450.
FoSSaCS-2013-Czajka #higher-order #logic: Partiality and Recursion in Higher-Order Logic (LC0), pp. 177–192.
FoSSaCS-2013-KarandikarS #complexity #parametricity #problem: The Parametric Ordinal-Recursive Complexity of Post Embedding Problems (PK, SS), pp. 273–288.
STOC-2013-BitanskyCCT #composition: Recursive composition and bootstrapping for SNARKS and proof-carrying data (NB, RC, AC, ET), pp. 111–120.
STOC-2013-KleinMS #graph #linear: Structured recursive separator decompositions for planar graphs in linear time (PNK, SM, CS), pp. 505–514.
CADE-2013-IosifRS #logic: The Tree Width of Separation Logic with Recursive Definitions (RI, AR, JS), pp. 21–38.
CAV-2013-AlbarghouthiGK #synthesis: Recursive Program Synthesis (AA, SG, ZK), pp. 934–950.
CSL-2013-BroadbentK #higher-order #model checking: Saturation-Based Model Checking of Higher-Order Recursion Schemes (CHB, NK), pp. 129–148.
CSL-2013-Oitavem #nondeterminism: From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (IO), pp. 24–27.
LICS-2013-BirkedalM #fixpoint #type system: Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes (LB, REM), pp. 213–222.
SIGMOD-2012-GhazalSCA #adaptation #optimisation #query: Adaptive optimizations of recursive queries in teradata (AG, DYS, AC, MAK), pp. 851–860.
VLDB-2012-MihaylovIG #named: REX: Recursive, Delta-Based Data-Centric Computation (SRM, ZGI, SG), pp. 1280–1291.
CIAA-2012-AmaviCR #xml: Weak Inclusion for Recursive XML Types (JA, JC, PR), pp. 78–89.
ICALP-v2-2012-OngT #game studies #semantics: Two-Level Game Semantics, Intersection Types, and Recursion Schemes (CHLO, TT), pp. 325–336.
ICFP-2012-SeveriV #finite #normalisation #type system: Pure type systems with corecursion on streams: from finite to infinitary normalisation (PS, FJdV), pp. 141–152.
EDOC-2012-DohringSG #adaptation #approach #aspect-oriented #model transformation #rule-based #runtime #weaving #workflow: Emulating Runtime Workflow Adaptation and Aspect Weaving by Recursive Rule-Based Sub-Process Selection — A Model Transformation Approach (MD, AS, IG), pp. 133–142.
CIKM-2012-KimKKO #modelling #process #topic: Modeling topic hierarchies with the recursive chinese restaurant process (JHK, DK, SK, AHO), pp. 783–792.
ICPR-2012-LiuCSTN #learning #multi #performance #problem #scalability: Recursive NMF: Efficient label tree learning for large multi-class problems (LL, PMC, SS, PNT, AN), pp. 2148–2151.
ICPR-2012-RiechertZMK #estimation #hybrid #realtime #using: Real-time disparity estimation using line-wise hybrid recursive matching and cross-bilateral median up-sampling (CR, FZ, MM, PK), pp. 3168–3171.
KR-2012-GottlobS #datalog #ontology #query #source code: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs (GG, TS).
POPL-2012-BouajjaniE #analysis #parallel #source code: Analysis of recursively parallel programs (AB, ME), pp. 203–214.
POPL-2012-MadhusudanQS #induction #proving: Recursive proofs for inductive tree data-structures (PM, XQ, AS), pp. 123–136.
PPDP-2012-Thielecke #continuation #functional #parsing #semantics: Functional semantics of parsing actions, and left recursion elimination as continuation passing (HT), pp. 91–102.
SAC-2012-Ancona #prolog: Regular corecursion in Prolog (DA), pp. 1897–1902.
DAC-2012-MiddendorfBH #hardware #synthesis: Hardware synthesis of recursive functions through partial stream rewriting (LM, CB, CH), pp. 1207–1215.
FASE-2012-BradfieldS #calculus #qvt #μ-calculus: Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal μ Calculus (JCB, PS), pp. 194–208.
TACAS-2012-SonnexDE #automation #data type #named #proving: Zeno: An Automated Prover for Properties of Recursive Data Structures (WS, SD, SE), pp. 407–421.
IJCAR-2012-BoerBR #automation #pointer #source code #verification: Automated Verification of Recursive Programs with Pointers (FSdB, MMB, JR), pp. 149–163.
LICS-2012-CarayolS #automaton #effectiveness #equivalence #safety: Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection (AC, OS), pp. 165–174.
LICS-2012-HaddadSS #complexity #petri net: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (SH, SS, PS), pp. 355–364.
TAP-2012-ChedorJM #generative #testing: Test Generation from Recursive Tiles Systems (SC, TJ, CM), pp. 99–114.
SIGMOD-2011-BaoDM #on the fly #workflow: Labeling recursive workflow executions on-the-fly (ZB, SBD, TM), pp. 493–504.
ITiCSE-2011-Mirolo: Is iteration really easier to master than recursion: an investigation in a functional-first CS1 context (CM), p. 362.
ICALP-v1-2011-MagniezNSX #bound #complexity #random: Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (FM, AN, MS, DX), pp. 317–329.
ICALP-v2-2011-BrazdilKKV #analysis #bound #probability #runtime #source code: Runtime Analysis of Probabilistic Programs with Unbounded Recursion (TB, SK, AK, IHV), pp. 319–331.
ICALP-v2-2011-SchmitzS #bound #multi: Multiply-Recursive Upper Bounds with Higman’s Lemma (SS, PS), pp. 441–452.
RTA-2011-BrockschmidtOG #bytecode #composition #java #proving #source code #term rewriting #termination: Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting (MB, CO, JG), pp. 155–170.
RTA-2011-MoserS #complexity #dependence #framework #multi #proving #termination: Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity (GM, AS), pp. 235–250.
RTA-2011-NishidaV: Program Inversion for Tail Recursive Functions (NN, GV), pp. 283–298.
ICFP-2011-AhnS #combinator #data type #induction: A hierarchy of mendler style recursion combinators: taming inductive datatypes with negative occurrences (KYA, TS), pp. 234–246.
ICFP-2011-GhicaSS #compilation #geometry #hardware #synthesis: Geometry of synthesis iv: compiling affine recursion into static hardware (DRG, AIS, SS), pp. 221–233.
ICFP-2011-PopescuG #syntax: Recursion principles for syntax with bindings and substitution (AP, ELG), pp. 346–358.
DiGRA-2011-MitgutschW #design #game studies #learning: Subversive Game Design for Recursive Learning (KM, MW).
ICML-2011-SocherLNM #natural language #network #parsing: Parsing Natural Scenes and Natural Language with Recursive Neural Networks (RS, CCYL, AYN, CDM), pp. 129–136.
KDD-2011-HendersonGLAETF #graph #mining #using: It’s who you know: graph mining using recursive structural features (KH, BG, LL, LA, TER, HT, CF), pp. 663–671.
BX-2011-Hidaka #bidirectional #graph transformation: Bidirectional Graph Transformations based on Structural Recursion (SH), p. 59.
OOPSLA-2011-ImNGP #type system: A syntactic type system for recursive modules (HI, KN, JG, SP), pp. 993–1012.
OOPSLA-2011-JoK #locality #traversal: Enhancing locality for recursive traversals of recursive structures (YJ, MK), pp. 463–482.
PADL-2011-DevrieseP #combinator #domain-specific language #semiparsing: Explicitly Recursive Grammar Combinators — A Better Model for Shallow Parser DSLs (DD, FP), pp. 84–98.
POPL-2011-BirkedalRSSTY #modelling: Step-indexed kripke models over recursive worlds (LB, BR, JS, KS, JT, HY), pp. 119–132.
PPDP-2011-AlvesFFM #λ-calculus: Linearity and recursion in a typed λ-calculus (SA, MF, MF, IM), pp. 173–182.
PPDP-2011-SchernhammerM #axiom #incremental #specification: Incremental checking of well-founded recursive specifications modulo axioms (FS, JM), pp. 5–16.
SAS-2011-SuterKK #satisfiability #source code: Satisfiability Modulo Recursive Programs (PS, ASK, VK), pp. 298–315.
SIGAda-2011-Moore #parallel #stack: Stack safe parallel recursion with paraffin (BJM), pp. 27–34.
LDTA-2011-SergeyC #automaton #type checking: From type checking by recursive descent to type checking with an abstract machine (IS, DC), p. 2.
CASE-2011-ColP #detection #performance: Fast and accurate object detection by means of recursive monomial feature elimination and cascade of SVM (LDC, FAP), pp. 304–309.
FoSSaCS-2011-Kobayashi #algorithm #automaton #higher-order #linear #model checking: A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (NK0), pp. 260–274.
FoSSaCS-2011-SchwinghammerBS #metric: A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces (JS, LB, KS), pp. 305–319.
CADE-2011-ArnaudCD #protocol #security #testing: Deciding Security for Protocols with Recursive Tests (MA, VC, SD), pp. 49–63.
CAV-2011-HagueL #data type #model checking #source code: Model Checking Recursive Programs with Numeric Data Types (MH, AWL), pp. 743–759.
CSL-2011-GroheGHL #logic: L-Recursion and a new Logic for Logarithmic Space (MG, BG, AH, BL), pp. 277–291.
CSL-2011-Schwencke #nondeterminism: A Category Theoretic View of Nondeterministic Recursive Program Schemes (DS), pp. 496–511.
ICST-2011-HeamN #data type #generative #named #random #testing: Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing (PCH, CN), pp. 60–69.
LICS-2011-FigueiraFSS #bound: Ackermannian and Primitive-Recursive Bounds with Dickson’s Lemma (DF, SF, SS, PS), pp. 269–278.
DocEng-2010-ChaoTZA #composition #image: Blocked recursive image composition with exclusion zones (HC, DT, XZ, CBA), pp. 111–114.
ITiCSE-2010-Mirolo #analysis #learning #multi #student: Learning (through) recursion: a multidimensional analysis of the competences achieved by CS1 students (CM), pp. 160–164.
ITiCSE-2010-Rubio-Sanchez #programming: Tail recursive programming by applying generalization (MRS), pp. 98–102.
ITiCSE-2010-ScholtzS #comprehension #modelling #student: Mental models of recursion: investigating students’ understanding of recursion (TLS, IDS), pp. 103–107.
FLOPS-2010-MorihataM #automation #parallel #quantifier #using: Automatic Parallelization of Recursive Functions Using Quantifier Elimination (AM, KM), pp. 321–336.
ILC-2010-YasugiKHU #continuation: Managing continuations for proper tail recursion (MY, TK, TH, SU), pp. 65–72.
ICPR-2010-HasanbelliuGP #algorithm #kernel #online: A Recursive Online Kernel PCA Algorithm (EH, LGSG, JCP), pp. 169–172.
ICPR-2010-KopenkovM #algorithm #performance #research: Research the Performance of a Recursive Algorithm of the Local Discrete Wavelet Transform (VNK, VVM), pp. 4452–4455.
ICPR-2010-PrabhuR #video: Recursive Video Matting and Denoising (SMP, ANR), pp. 4524–4527.
ICPR-2010-TasdizenH #algorithm #estimation #video: Recursive Dynamically Variable Step Search Motion Estimation Algorithm for High Definition Video (OT, IH), pp. 2354–2357.
ICPR-2010-XiongOL #algorithm #composition: A Recursive and Model-Constrained Region Splitting Algorithm for Cell Clump Decomposition (WX, SHO, JHL), pp. 4416–4419.
OOPSLA-2010-HerzeelC #control flow #interactive #parallel: Dynamic parallelization of recursive code: part 1: managing control flow interactions with the continuator (CH, PC), pp. 377–396.
POPL-2010-KobayashiTU #higher-order #multi #transducer #verification: Higher-order multi-parameter tree transducers and recursion schemes for program verification (NK, NT, HU), pp. 495–508.
LDTA-2009-BoylandS10 #generative #parsing: TOOL PAPER: ScalaBison Recursive Ascent-Descent Parser Generator (JB, DS), pp. 65–74.
DATE-2010-CollinsVC #code generation #manycore #parallel: Recursion-driven parallel code generation for multi-core platforms (RLC, BV, LPC), pp. 190–195.
DATE-2010-IqbalSH #estimation #execution #named #order #pipes and filters: RMOT: Recursion in model order for task execution time estimation in a software pipeline (NI, MAS, JH), pp. 953–956.
FoSSaCS-2010-MiliusMS #semantics: CIA Structures and the Semantics of Recursion (SM, LSM, DS), pp. 312–327.
FoSSaCS-2010-TsukadaK #infinity: Untyped Recursion Schemes and Infinite Intersection Types (TT, NK), pp. 343–357.
TACAS-2010-Aderhold #analysis #automation #higher-order #source code #termination: Automated Termination Analysis for Programs with Second-Order Recursion (MA), pp. 221–235.
IJCAR-2010-Aderhold #automation #axiom #higher-order #induction #source code #synthesis: Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion (MA), pp. 263–277.
LICS-2010-BroadbentCOS #logic: Recursion Schemes and Logical Reflection (CHB, AC, CHLO, OS), pp. 120–129.
TAP-2010-Blanchette #algebra #analysis #data type #induction #relational: Relational Analysis of (Co)inductive Predicates, (Co)algebraic Datatypes, and (Co)recursive Functions (JCB), pp. 117–134.
ITiCSE-2009-GunionMS: Curing recursion aversion (KG, TM, US), pp. 124–128.
ITiCSE-2009-Mirolo #analysis #modelling #problem: Mental models of recursive computations vs. recursive analysis in the problem domain (CM), p. 397.
ITiCSE-2009-Rubio-SanchezV #using: Tail recursion by using function generalization (MRS, JÁVI), p. 394.
ITiCSE-2009-Stephenson #visual notation: Visual examples of recursion (BS), p. 400.
ITiCSE-2009-Velazquez-IturbidePU #interactive #visualisation: Interactive visualization of recursion with SRec (JÁVI, APC, JUF), p. 339.
CIAA-2009-Sastre-Martinez #network #parsing #performance #using: Efficient Parsing Using Filtered-Popping Recursive Transition Networks (JMSM), pp. 241–244.
ICALP-v2-2009-KobayashiO #calculus #complexity #model checking #μ-calculus: Complexity of Model Checking Recursion Schemes for Fragments of the Modal μ-Calculus (NK, CHLO), pp. 223–234.
FM-2009-JaffarS #abstraction: Recursive Abstractions for Parameterized Systems (JJ, AES), pp. 72–88.
ICFP-2009-YakushevHLJ #data type #fixpoint #programming: Generic programming with fixed points for mutually recursive datatypes (ARY, SH, AL, JJ), pp. 233–244.
PLDI-2009-TorreMP #calculus #fixpoint #source code #using: Analyzing recursive programs using a fixed-point calculus (SLT, PM, GP), pp. 211–222.
POPL-2009-Kobayashi #higher-order #source code #verification: Types and higher-order recursion schemes for verification of higher-order programs (NK), pp. 416–428.
CC-2009-GaoLXN #concurrent #predict #source code #thread: Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction (LG, LL, JX, TFN), pp. 78–93.
PPoPP-2009-YangHLSS #parallel: Stack-based parallel recursion on graphics processors (KY, BH, QL, PVS, JS), pp. 299–300.
FoSSaCS-2009-BirkedalST #morphism #parametricity #polymorphism #semantics: Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types (LB, KS, JT), pp. 456–470.
FoSSaCS-2009-BolligGH #concurrent #source code: Realizability of Concurrent Recursive Programs (BB, MLG, PH), pp. 410–424.
FoSSaCS-2009-BroadbentO #higher-order #model checking #on the: On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (CHB, CHLO), pp. 107–121.
CSL-2009-Moschovakis #theorem: Kleene’s Amazing Second Recursion Theorem (YNM), pp. 24–39.
LICS-2009-KobayashiO #calculus #higher-order #model checking #type system #μ-calculus: A Type System Equivalent to the Modal μ-Calculus Model Checking of Higher-Order Recursion Schemes (NK, CHLO), pp. 179–188.
CBSE-2008-BothZ #automation #component #consistency #parallel #protocol: Automatic Protocol Conformance Checking of Recursive and Parallel Component-Based Systems (AB, WZ), pp. 163–179.
ITiCSE-2008-Rubio-SanchezUP: A gentle introduction to mutual recursion (MRS, JUF, CPF), pp. 235–239.
ITiCSE-2008-Velazquez-IturbidePU #algorithm #animation #named: SRec: an animation system of recursion for algorithm courses (JÁVI, APC, JUF), pp. 225–229.
PASTE-2008-MarronMHSK #analysis #array: Sharing analysis of arrays, collections, and recursive structures (MM, MML, MVH, DS, DK), pp. 43–49.
AFL-2008-KuskeL #automation #graph: Euler paths and ends in automatic and recursive graphs (DK, ML), pp. 245–256.
CIAA-2008-Yannakakis #automaton #probability: Automata, Probability, and Recursion (MY), pp. 23–32.
DLT-2008-CaludeNSS #set #string: Universal Recursively Enumerable Sets of Strings (CSC, AN, LS, FS), pp. 170–182.
ICALP-A-2008-EtessamiWY #game studies #probability: Recursive Stochastic Games with Positive Rewards (KE, DW, MY), pp. 711–723.
ICALP-A-2008-TedderCHP #composition #linear #permutation: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations (MT, DGC, MH, CP), pp. 634–645.
ICALP-B-2008-Jurdzinski: Leftist Grammars Are Non-primitive Recursive (TJ), pp. 51–62.
RTA-2008-Toyama #lisp #proving #term rewriting #termination: Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (YT), pp. 381–391.
Haskell-2008-AhnS #algebra #data type #type system: Shared subtypes: subtyping recursive parametrized algebraic data types (KYA, TS), pp. 75–86.
ICFP-2008-Krauss #data type #problem: Pattern minimization problems over recursive data types (AK), pp. 267–274.
ICFP-2008-MorihataMT #framework #query: Write it recursively: a generic framework for optimal path queries (AM, KM, MT), pp. 169–178.
ICPR-2008-HuynhH #estimation #sequence #video: Recursive structure and motion estimation from noisy uncalibrated video sequences (DQH, AH), pp. 1–5.
PADL-2008-FrostHC #ambiguity #combinator #parsing: Parser Combinators for Ambiguous Left-Recursive Grammars (RAF, RH, PC), pp. 167–181.
PEPM-2008-EdwardsZ #concurrent: Static elaboration of recursion for concurrent software (SAE, JZ), pp. 71–80.
PEPM-2008-WarthDM #parsing: Packrat parsers can support left recursion (AW, JRD, TDM), pp. 103–110.
POPL-2008-Chaudhuri #algorithm #state machine: Subcubic algorithms for recursive state machines (SC), pp. 159–169.
PPDP-2008-BertotK #coq #fixpoint #semantics: Fixed point semantics and partial recursion in Coq (YB, VK), pp. 89–96.
SAS-2008-CominiDV #abstract interpretation #on the #polymorphism #type system: On Polymorphic Recursion, Type Systems, and Abstract Interpretation (MC, FD, SV), pp. 144–158.
DATE-2008-KoenigSB #algorithm #novel: A Novel Recursive Algorithm for Bit-Efficient Realization of Arbitrary Length Inverse Modified Cosine Transforms (RK, TS, JB), pp. 604–609.
CSL-2008-BonfanteKMO: Recursion Schemata for NCk (GB, RK, JYM, IO), pp. 49–63.
LICS-2008-ChambartS #complexity: The Ordinal Recursive Complexity of Lossy Channel Systems (PC, PS), pp. 205–216.
LICS-2008-GacekMN: Combining Generic Judgments with Recursive Definitions (AG, DM, GN), pp. 33–44.
LICS-2008-HagueMOS #automaton: Collapsible Pushdown Automata and Recursion Schemes (MH, ASM, CHLO, OS), pp. 452–461.
ITiCSE-2007-Rubio-SanchezH #fibonacci: Exploring recursion with fibonacci numbers (MRS, IHL), p. 359.
ITiCSE-2007-SandersG #modelling #student: Students’ mental models of recursion at wits (IDS, VCG), p. 317.
ICALP-2007-TorreP #complexity #model checking #on the #state machine: On the Complexity of LtlModel-Checking of Recursive State Machines (SLT, GP), pp. 937–948.
TLCA-2007-DavidN #calculus #equation #normalisation #proving: An Arithmetical Proof of the Strong Normalization for the λ -Calculus with Recursive Equations on Types (RD, KN), pp. 84–101.
ICFP-2007-Dreyer #type system: A type system for recursive modules (DD), pp. 289–302.
AGTIVE-2007-VarroHV #graph #pattern matching: Recursive Graph Pattern Matching (GV, ÁH, DV), pp. 456–470.
GT-VMT-2007-GuerraL #graph transformation: Adding Recursion to Graph Transformation (EG, JdL).
GT-VMT-2007-MackiePV #interactive #programming #visual notation: Visual Programming with Recursion Patterns in Interaction Nets (IM, JSP, MV).
HCI-MIE-2007-HanKYJ #mobile #segmentation: Frame Segmentation Used MLP-Based X-Y Recursive for Mobile Cartoon Content (EH, KK, HY, KJ), pp. 872–881.
ICML-2007-KimP #learning: A recursive method for discriminative mixture learning (MK, VP), pp. 409–416.
RecSys-2007-ZhangP #algorithm #collaboration #predict #recommendation: A recursive prediction algorithm for collaborative filtering recommender systems (JZ, PP), pp. 57–64.
PLDI-2007-GuoVA #analysis #induction #synthesis: Shape analysis with inductive recursion synthesis (BG, NV, DIA), pp. 256–265.
LDTA-J-2005-JohnstoneS #automation #parsing #reduction: Automatic recursion engineering of reduction incorporated parsers (AJ, ES), pp. 95–110.
DAC-2007-YuYBY #clustering #network: Program Mapping onto Network Processors by Recursive Bipartitioning and Refining (JY, JY, LNB, JY), pp. 805–810.
CAV-2007-PatinST #named #parallel #source code #thread #verification: Spade: Verification of Multithreaded Dynamic and Recursive Programs (GP, MS, TT), pp. 254–257.
ICLP-2007-BaseliceBC #on the #source code: On Finitely Recursive Programs (SB, PAB, GC), pp. 89–103.
ITiCSE-2006-SandersGG #modelling #revisited: Mental models of recursion revisited (IDS, VG, TG), pp. 138–142.
ICALP-v2-2006-EtessamiY #concurrent #game studies #probability: Recursive Concurrent Stochastic Games (KE, MY), pp. 324–335.
FM-2006-Preoteasa #logic #pointer #using #verification: Mechanical Verification of Recursive Procedures Manipulating Pointers Using Separation Logic (VP), pp. 508–523.
RTA-2006-Koprowski #higher-order: Certified Higher-Order Recursive Path Ordering (AK), pp. 227–241.
FLOPS-2006-BartheFPR #coq #proving #reasoning: Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant (GB, JF, DP, VR), pp. 114–129.
Haskell-2006-RenE #haskell #scrap your boilerplate: A generic recursion toolbox for Haskell or: scrap your boilerplate systematically (DR, ME), pp. 13–24.
ICFP-2006-NakataG #programming: Recursive modules for programming (KN, JG), pp. 74–86.
ICPR-v1-2006-RyooA #comprehension #process #semantics: Semantic Understanding of Continued and Recursive Human Activities (MSR, JKA), pp. 379–382.
ICPR-v1-2006-TavakkoliNB #detection #learning #robust: Robust Recursive Learning for Foreground Region Detection in Videos with Quasi-Stationary Backgrounds (AT, MN, GB), pp. 315–318.
ICPR-v3-2006-BianchiniMS #locality #network #using: Object Localization Using Input/Output Recursive Neural Networks (MB, MM, LS), pp. 95–98.
ICPR-v3-2006-JainHSVHG #algorithm #clustering #hybrid #sequence: A Hybrid, Recursive Algorithm for Clustering Expressed Sequence Tags in Chlamydomonas reinhardtii (MJ, HJH, JS, OV, CH, AG), pp. 404–407.
ESOP-2006-Ahmed #logic #quantifier: Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types (AJA), pp. 69–83.
FoSSaCS-2006-LodingS #logic #source code: Propositional Dynamic Logic with Recursive Programs (CL, OS), pp. 292–306.
TACAS-2006-ChakiCKRT #c #concurrent #message passing #source code #verification: Verifying Concurrent Message-Passing C Programs with Recursive Calls (SC, EMC, NK, TWR, TT), pp. 334–349.
IJCAR-2006-KoprowskiZ #automation #infinity #order #term rewriting: Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems (AK, HZ), pp. 332–346.
IJCAR-2006-Krauss #higher-order #logic: Partial Recursive Functions in Higher-Order Logic (AK), pp. 589–603.
IJCAR-2006-UrbanB #combinator #data type #higher-order: A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL (CU, SB), pp. 498–512.
LICS-2006-Ong #higher-order #model checking #on the: On Model-Checking Trees Generated by Higher-Order Recursion Schemes (CHLO), pp. 81–90.
LICS-2006-TerauchiA #on the #polymorphism: On Typability for Rank-2 Intersection Types with Polymorphic Recursion (TT, AA), pp. 111–122.
VMCAI-2006-BalabanCP #abstraction #ranking #source code: Ranking Abstraction of Recursive Programs (IB, AC, AP), pp. 267–281.
VMCAI-2006-BozzelliTP #communication #state machine #verification: Verification of Well-Formed Communicating Recursive State Machines (LB, SLT, AP), pp. 412–426.
PODS-2005-Koch #complexity #functional #on the #query #xquery: On the complexity of nonrecursive XQuery and functional query languages on complex values (CK), pp. 84–97.
SIGMOD-2005-Ordonez #optimisation #query #sql: Optimizing recursive queries in SQL (CO), pp. 834–839.
VLDB-2005-FanYLLR #query #sql #xpath: Query Translation from XPath to SQL in the Presence of Recursive DTDs (WF, JXY, HL, JL, RR), pp. 337–348.
ITiCSE-2005-Rosenthal #multi #using: Introducing recursion by using multimedia (TR), p. 374.
CIAA-2005-SubramanianS #automaton #documentation #finite #using #xml: Compressing XML Documents Using Recursive Finite State Automata (HS, PS), pp. 282–293.
DLT-2005-Kortelainen #generative #polynomial: Polynomial Generators of Recursively Enumerable Languages (JK), pp. 320–326.
ICALP-2005-EtessamiY #game studies #markov #probability #process: Recursive Markov Decision Processes and Recursive Stochastic Games (KE, MY), pp. 891–903.
ICALP-2005-MurawskiOW #algol #equivalence: Idealized Algol with Ground Recursion, and DPDA Equivalence (ASM, CHLO, IW), pp. 917–929.
SEFM-2005-GervaisFL #database #generative #relational #transaction: Generating Relational Database Transactions From Recursive Functions Defined on EB3 Traces (FG, MF, RL), pp. 117–126.
TLCA-2005-AehligMO #decidability #higher-order #monad: The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable (KA, JGdM, CHLO), pp. 39–54.
TLCA-2005-BoveC #higher-order: Recursive Functions with Higher Order Domains (AB, VC), pp. 116–130.
TLCA-2005-CosmoPR #commutative #type system: Subtyping Recursive Types Modulo Associative Commutative Products (RDC, FP, DR), pp. 179–193.
TLCA-2005-Damiani #polymorphism: Rank-2 Intersection and Polymorphic Recursion (FD), pp. 146–161.
ICFP-2005-Dreyer: Recursive type generativity (DD), pp. 41–53.
MLDM-2005-FerrandizB #graph #multi: Multivariate Discretization by Recursive Supervised Bipartition of Graph (SF, MB), pp. 253–264.
SIGIR-2005-LiY #analysis: Analysis of recursive feature elimination methods (FL, YY), pp. 633–634.
POPL-2005-SumiiP #abstraction #bisimulation: A bisimulation for type abstraction and recursion (ES, BCP), pp. 63–74.
SAC-2005-FarahabadyS #multi #network: The recursive transpose-connected cycles (RTCC) interconnection network for multiprocessors (MHF, HSA), pp. 734–738.
SAC-2005-LiY #classification #predict #using: Using recursive classification to discover predictive features (FL, YY), pp. 1054–1058.
SAC-2005-SerranoO #framework #interactive #protocol #semantics #specification: A semantic framework for the recursive specification of interaction protocols (JMS, SO), pp. 451–456.
LDTA-2005-JohnstoneS #parsing #reduction: Recursion Engineering for Reduction Incorporated Parsers (AJ, ES), pp. 143–160.
ESOP-2005-PodelskiSW #source code #summary: Summaries for While Programs with Recursion (AP, IS, SW), pp. 94–107.
TACAS-2005-AlurCEM #detection #on the fly #reachability #state machine: On-the-Fly Reachability and Cycle Detection for Recursive State Machines (RA, SC, KE, PM), pp. 61–76.
TACAS-2005-EtessamiY #algorithm #probability #state machine #verification: Algorithmic Verification of Recursive Probabilistic State Machines (KE, MY), pp. 253–270.
CSL-2005-SchurmannS #identification #polynomial: Identifying Polynomial-Time Recursive Functions (CS, JS), pp. 525–540.
LICS-2005-Lago #geometry #higher-order #linear: The Geometry of Linear Higher-Order Recursion (UDL), pp. 366–375.
LICS-2005-MelliesV #framework #parametricity #polymorphism: Recursive Polymorphic Types and Parametricity in an Operational Framework (PAM, JV), pp. 82–91.
PODS-2004-Bonatti #datalog #decidability #on the #query: On the Decidability of Containment of Recursive Datalog Queries — Preliminary report (PAB), pp. 297–306.
ITiCSE-2004-Ginat04a #question #student: Do senior CS students capitalize on recursion? (DG), pp. 82–86.
ICALP-2004-BusiGZ #calculus #process #replication: Comparing Recursion, Replication, and Iteration in Process Calculi (NB, MG, GZ), pp. 307–319.
ICFP-2004-GauthierP #canonical #first-order #higher-order #matter: Numbering matters: first-order canonical forms for second-order recursive types (NG, FP), pp. 150–161.
IFL-2004-Trancon-y-Widemann #evaluation #strict #virtual machine: V->M: A Virtual Machine for Strict Evaluation of (Co)Recursive Functions (BTyW), pp. 90–107.
ICPR-v1-2004-MicheletGBC #estimation #multi #network: Local Multiple Orientation Estimation: Isotropic and Recursive Oriented Network (FM, CG, PB, JPDC), pp. 712–715.
ICPR-v2-2004-MilanovaTK #algorithm #composition #image: Lossless Data Compression for Image Decomposition With Recursive IDP Algorithm (MGM, VT, RK), pp. 823–826.
ICPR-v2-2004-YuWC #3d #algorithm #multi #performance #re-engineering: A Fast Recursive 3D Model Reconstruction Algorithm for Multimedia Applications (YKY, KhW, MMYC), pp. 241–244.
POPL-2004-Dreyer #type system: A type system for well-founded recursion (DD), pp. 293–305.
POPL-2004-Fiore #morphism #polynomial: Isomorphisms of generic recursive polynomial types (MPF), pp. 77–88.
LDTA-2004-LohmannRS #attribute grammar #migration #semantics: Semantics-preserving Migration of Semantic Rules During Left Recursion Removal in Attribute Grammars (WL, GR, MS), pp. 133–148.
DAC-2004-BaneresCK #paradigm: A recursive paradigm to solve Boolean relations (DB, JC, MK), pp. 416–421.
FoSSaCS-2004-GianantonioM #category theory: Unifying Recursive and Co-recursive Definitions in Sheaf Categories (PDG, MM), pp. 136–150.
CSL-2004-AbelM #fixpoint: Fixed Points of Type Constructors and Primitive Recursion (AA, RM), pp. 190–204.
CSL-2004-Cordon-FrancoFM #induction: Provably Total Primitive Recursive Functions: Theories with Induction (ACF, AFM, FFLM), pp. 355–369.
FATES-2004-BruckerW #generative #testing: Symbolic Test Case Generation for Primitive Recursive Functions (ADB, BW), pp. 16–32.
IJCAR-2004-ZhangSM #constraints #data type #integer: Decision Procedures for Recursive Data Structures with Integer Constraints (TZ, HBS, ZM), pp. 152–167.
VMCAI-2004-Etessami #analysis #data flow #equation #game studies #graph #using: Analysis of Recursive Game Graphs Using Data Flow Equations (KE), pp. 282–296.
ICALP-2003-BusiGZ #calculus #replication: Replication vs. Recursive Definitions in Channel Based Calculi (NB, MG, GZ), pp. 133–144.
ICALP-2003-TorreNPP #state machine: Hierarchical and Recursive State Machines with Context-Dependent Properties (SLT, MN, MP, GP), pp. 776–789.
IFL-2003-VasconcelosH #equation #functional #higher-order #polymorphism #source code: Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs (PBV, KH), pp. 86–101.
ICEIS-v1-2003-WongL #multi #performance #streaming #video: Recursive Patching — An Efficient Technique for Multicast Video Streaming (YWW, JYBL), pp. 306–312.
POPL-2003-XiCC #data type: Guarded recursive datatype constructors (HX, CC, GC), pp. 224–235.
PPDP-2003-HirschowitzLW #call-by #compilation #functional: Compilation of extended recursion in call-by-value functional languages (TH, XL, JBW), pp. 160–171.
SAS-2003-ChongR #data type #static analysis: Static Analysis of Accessed Regions in Recursive Data Structures (SC, RR), pp. 463–482.
SAC-2003-VulloF #approach #predict: A Recursive Connectionist Approach for Predicting Disulfide Connectivity in Proteins (AV, PF), pp. 67–71.
ESOP-2003-ClementsF #semantics #stack: A Tail-Recursive Semantics for Stack Inspections (JC, MF), pp. 22–37.
FASE-2003-TenzerS #diagrams #modelling #uml: Modelling Recursive Calls with UML State Diagrams (JT, PS), pp. 135–149.
TACAS-2003-AlurTM #composition #game studies #graph: Modular Strategies for Recursive Game Graphs (RA, SLT, PM), pp. 363–378.
CAV-2003-AlurTM #composition #game studies #graph #infinity: Modular Strategies for Infinite Games on Recursive Graphs (RA, SLT, PM), pp. 67–79.
LICS-2003-KuncakR #decidability #type system: Structural Subtyping of Non-Recursive Types is Decidable (VK, MCR), pp. 96–107.
VLDB-2002-ParkMC #query #xml: Structural Function Inlining Technique for Structurally Recursive XML Queries (CWP, JKM, CWC), pp. 83–94.
ITiCSE-2002-HabermanA #student #why: The case of base cases: why are they so difficult to recognize? student difficulties with recursion (BH, HA), pp. 84–88.
ITiCSE-2002-LevyL #syntax: Shared terminology, private syntax: the case of recursive descriptions (DL, TL), pp. 89–93.
ICALP-2002-Brattka #random #set: Random Numbers and an Incomplete Immune Recursive Set (VB), pp. 950–961.
ICALP-2002-Stirling #equivalence: Deciding DPDA Equivalence Is Primitive Recursive (CS), pp. 821–832.
RTA-2002-Tahhan-Bittar #bound #confluence #term rewriting: Recursive Derivational Length Bounds for Confluent Term Rewrite Systems (ETB), pp. 281–295.
FLOPS-2002-Smaus #polymorphism: The Head Condition and Polymorphic Recursion (JGS), pp. 259–274.
ICPR-v1-2002-CucchiaraGPSP #clustering: Building the Topological Tree by Recursive FCM Color Clustering (RC, CG, AP, SS, GP), pp. 759–762.
ASIA-PEPM-2002-Nemytykh: A note on elimination of simplest recursions (APN), pp. 138–146.
PEPM-2002-LiuS #data type #optimisation #using: Program optimization using indexed and recursive data structures (YAL, SDS), pp. 108–118.
SAS-2002-Venet #alias #analysis #array #data type: Nonuniform Alias Analysis of Recursive Data Structures and Arrays (AV), pp. 36–51.
TACAS-2002-BasuKPR #model checking #source code: Resource-Constrained Model Checking of Recursive Programs (SB, KNK, LRP, CRR), pp. 236–250.
CADE-2002-BorrallerasLR #order: Recursive Path Orderings Can Be Context-Sensitive (CB, SL, AR), pp. 314–331.
CSL-2002-Kakutani #call-by: Duality between Call-by-Name Recursion and Call-by-Value Iteration (YK), pp. 506–521.
CSL-2002-Nipkow #bound #hoare #logic #nondeterminism: Hoare Logics for Recursive Procedures and Unbounded Nondeterminism (TN), pp. 103–119.
LICS-2002-Simpson #modelling #set: Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory (AKS), pp. 287–298.
ICDAR-2001-ShinjoHMSS #analysis #recognition: A Recursive Analysis for Form Cell Recognition (HS, EH, KM, YS, HS), pp. 694–698.
ITiCSE-2001-DannCP #education #using #visualisation: Using visualization to teach novices recursion (WD, SC, RP), pp. 109–112.
ITiCSE-2001-Rasala: Exploring recursion in Hilbert curves (RR), p. 194.
ITiCSE-2001-Sooriamurthi #problem: Problems in comprehending recursion and suggested solutions (RS), pp. 25–28.
RTA-2001-BerarducciB #algebra #higher-order: General Recursion on Second Order Term Algebras (AB, CB), pp. 15–30.
TLCA-2001-Chroboczek #game studies #type system: Subtyping Recursive Games (JC), pp. 61–75.
ICFP-2001-Russo #ml #standard: Recursive Structures for Standard ML (CVR), pp. 50–61.
LOPSTR-2001-Caldwell #type system: Extracting General Recursive Program Schemes in Nuprl’s Type Theory (JLC), pp. 233–244.
CC-2001-RinetzkyS #analysis #interprocedural #source code: Interprocedural Shape Analysis for Recursive Programs (NR, SS), pp. 133–149.
ESOP-2001-Boudol #revisited #semantics: The Recursive Record Semantics of Objects Revisited (GB), pp. 269–283.
FoSSaCS-2001-Coppo #equation #type inference: Type Inference with Recursive Type Equations (MC), pp. 184–198.
FoSSaCS-2001-HasegawaK #axiom #call-by: Axioms for Recursion in Call-by-Value (MH, YK), pp. 246–260.
CAV-2001-AlurEY #analysis #state machine: Analysis of Recursive State Machines (RA, KE, MY), pp. 207–220.
CAV-2001-EsparzaS #model checking #source code: A BDD-Based Model Checker for Recursive Programs (JE, SS), pp. 324–336.
CSL-2001-Goubault-Larrecq: Well-Founded Recursive Relations (JGL), pp. 484–497.
CSL-2001-Schurmann #encoding #higher-order: Recursion for Higher-Order Encodings (CS), pp. 585–599.
WLC-2000-Brattka #exponential #modelling: The Emperor’s New Recursiveness: The Epigraph of the Exponential Function in Two Models of Computability (VB), pp. 63–72.
ICFP-2000-ErkokL #monad: Recursive monadic bindings (LE, JL), pp. 174–185.
ICFP-2000-GapeyevLP #functional #type system: Recursive subtyping revealed: functional pearl (VG, MYL, BCP), pp. 221–231.
ICML-2000-Zaanen #learning #syntax #using: Bootstrapping Syntax and Recursion using Alginment-Based Learning (MvZ), pp. 1063–1070.
ICPR-v1-2000-FujikiK #modelling: Recursive Factorization Method for the Paraperspective Model Based on the Perspective Projection (JF, TK), pp. 1406–1410.
ICPR-v2-2000-ChenC: Recursive Conversion of Chain Code into Quadtree with Table Lookup (ZC, IPC), pp. 6054–6057.
ICPR-v2-2000-Haindl: Recursive Square-Root Filters (MH), pp. 6014–6017.
ICPR-v3-2000-GatosM #algorithm #novel #using: A Novel Recursive Algorithm for Area Location Using Isothetic Polygons (BG, SLM), pp. 3496–3499.
ICPR-v3-2000-Haindl00a #image #modelling: Recursive Model-Based Image Restoration (MH), pp. 3346–3349.
ICPR-v3-2000-YoungVG: Recursive Gabor Filtering (ITY, LJvV, MvG), pp. 3342–3345.
PEPM-2000-LiuS #optimisation #question #what: From Recursion to Iteration: What are the Optimizations? (YAL, SDS), pp. 73–82.
PLDI-2000-YiAK #memory management #multi: Transforming loops to recursion for multi-level memory hierarchies (QY, VSA, KK), pp. 169–181.
POPL-2000-AspertiCM: (Optimal) Duplication is not Elementary Recursive (AA, PC, SM), pp. 96–107.
PPDP-2000-Giavitto #data type #framework: A framework for the recursive definition of data structures (JLG), pp. 45–55.
ASE-2000-Monroy #abduction #using: The Use of Abduction and Recursion-Editor Techniques for the Correction of Faulty Conjectures (RM), pp. 91–100.
DAC-2000-CaldwellKM #question: Can recursive bisection alone produce routable placements? (AEC, ABK, ILM), pp. 477–482.
DATE-2000-KallaZCH #framework #paradigm #satisfiability #using: A BDD-Based Satisfiability Infrastructure Using the Unate Recursive Paradigm (PK, ZZ, MJC, CH), pp. 232–236.
CL-2000-BoultonS #automation #induction: Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions (RJB, KS), pp. 629–643.
CL-2000-OliboniT #query #xml: Querying XML Specified WWW Sites: Links and Recursion in XML-GL (BO, LT), pp. 1167–1181.
LICS-2000-Nakano: A Modality for Recursion (HN), pp. 255–266.
LICS-2000-PalsbergZ #flexibility #performance: Efficient and Flexible Matching of Recursive Types (JP, TZ), pp. 388–398.
ICDAR-1999-BishnuC #segmentation: Segmentation of Bangla Handwritten Text into Characters by Recursive Contour Following (AB, BBC), pp. 402–405.
ICDAR-1999-ToumitGE #automation #documentation: A Hierarchical and Recursive Model of Mathematical Expressions for Automatic Reading of Mathematical Documents (JT, SGS, HE), pp. 119–122.
PODS-1999-Cosmadakis #complexity #query: Inherent Complexity of Recursive Queries (SSC), pp. 148–154.
ICSM-1999-LiangH #interprocedural #pointer #slicing: Reuse-Driven Interprocedural Slicing in the Presence of Pointers and Recursion (DL, MJH), p. 421–?.
RTA-1999-Touzet #multi: A Characterisation of Multiply Recursive Functions with Higman’s Lemma (HT), pp. 163–174.
TLCA-1999-DybjerS #axiom #finite: A Finite Axiomatization of Inductive-Recursive Definitions (PD, AS), pp. 129–146.
ICFP-1999-HughesP #bound #embedded #ml #programming #towards: Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming (JH, LP), pp. 70–81.
ICFP-1999-SplawskiU #fixpoint: Type Fixpoints: Iteration vs. Recursion (ZS, PU), pp. 102–113.
IFL-1999-Groningen #functional #lazy evaluation #multi #optimisation #tuple: Optimising Recursive Functions Yielding Multiple Results in Tuples in a Lazy Functional Language (JHGvG), pp. 59–76.
ICML-1999-Pompe #induction: Noise-Tolerant Recursive Best-First Induction (UP), pp. 315–324.
OOPSLA-1999-OvlingerW #specification #traversal: A Language for Specifying Recursive Traversals of Object Structures (JO, MW), pp. 70–81.
TOOLS-USA-1999-ConcepcionLS #development #multi #thread #using: Managing the Software Development by Using the Recursive Multi- Threaded (RMT) Tool (AIC, SL, SJS), pp. 344–353.
GCSE-1999-ForaxR #java #pattern matching: Recursive Types and Pattern-Matching in Java (RF, GR), pp. 147–164.
LOPSTR-1999-MetayerNR #testing #verification: Verification by Testing for Recursive Program Schemes (DLM, VAN, OR), pp. 255–272.
LOPSTR-1999-RossOS #source code: Making Mercury Programs Tail Recursive (PR, DO, ZS), pp. 196–215.
PLDI-1999-CraryHP #question #what: What is a Recursive Module? (KC, RH, SP), pp. 50–63.
PPDP-1999-KamareddineM #on the #proving #termination: On Formalised Proofs of Termination of Recursive Functions (FK, FM), pp. 29–46.
SAS-1999-LiuS: Eliminating Dead Code on Recursive Data (YAL, SDS), pp. 211–231.
ICSE-1999-ConcepcionLS #concurrent #development #monitoring #multi #predict #re-engineering #thread: The RMT (Recursive Multi-Threaded) Tool: A Computer Aided Software Engineering Tool for Monitoring and Predicting Software Development Progress (AIC, SL, SJS), pp. 660–663.
CC-1999-RubinBR #data type: Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures (SR, DB, MR), pp. 259–273.
DATE-1999-Marques-SilvaG #equivalence #learning #satisfiability #using: Combinational Equivalence Checking Using Satisfiability and Recursive Learning (JPMS, TG), pp. 145–149.
FoSSaCS-1999-AcetoI #logic #testing: Testing Hennessy-Milner Logic with Recursion (LA, AI), pp. 41–55.
LICS-1999-ColazzoG #kernel #type system: Subtyping Recursive Types in Kernel Fun (DC, GG), pp. 137–146.
LICS-1999-JouannaudR #higher-order: The Higher-Order Recursive Path Ordering (JPJ, AR), pp. 402–411.
LICS-1999-KfouryP #type inference: Type Inference for Recursive Definitions (AJK, SMPG), pp. 119–128.
PODS-1998-VorobyovV #complexity #logic programming #source code: Complexity of Nonrecursive Logic Programs with Complex Values (SGV, AV), pp. 244–253.
ICALP-1998-Gimenez #type system: Structural Recursive Definitions in Type Theory (EG), pp. 397–408.
ICALP-1998-HengleinR #automaton #complexity #constraints #type system: Constraint Automata and the Complexity of Recursive Subtype Entailment (FH, JR), pp. 616–627.
FLOPS-1998-IwasakiHT #towards: Towards Manipulation of Mutually Recursive Functions (HI, ZH, MT), pp. 61–79.
ICFP-1998-Haiming #context-free grammar: Combining CFG and Recursive Functions to Get a New Language (HC), p. 351.
ICPR-1998-Aladjem #classification #ml #network #reduction: Training of a ML neural network for classification via recursive reduction of the class separation (MA), pp. 450–452.
ICPR-1998-ChenC #network #performance #representation: Recursive representation and progressive display of binary objects for efficient network browsing (IPC, ZC), pp. 395–399.
ICPR-1998-SchaufAH #modelling #recognition #using: Model-based shape recognition using recursive mathematical morphology (MLS, SA, RMH), pp. 202–204.
ICPR-1998-VlietYV: Recursive Gaussian derivative filters (LJvV, ITY, PWV), pp. 509–514.
ICPR-1998-ZhaHH #3d #algorithm #modelling #using: A recursive fitting-and-splitting algorithm for 3-D object modeling using superquadrics (HZ, TH, TH), pp. 658–662.
TOOLS-ASIA-1998-Jarvi #c++: Compile Time Recursive Objects in C++ (JJ), pp. 66–77.
PLDI-1998-Clinger #performance: Proper Tail Recursion and Space Efficiency (WDC), pp. 174–185.
POPL-1998-AspertiM #parallel #reduction: Parallel β Reduction is not Elementary Recursive (AA, HGM), pp. 303–315.
SAC-1998-LiII #algorithm #constraints #estimation: A recursive time estimation algorithm for program traces under resource constraints (DL, YI, NI), pp. 635–640.
SAC-1998-LisleP #modelling #object-oriented: Recursive, object-oriented structures for molecular modeling (CL, RJP), pp. 50–54.
CC-1998-GhiyaHZ #c #detection #parallel #source code: Detecting Parallelism in C Programs with Recursive Darta Structures (RG, LJH, YZ), pp. 159–173.
CC-1998-JohnstoneS #generalised parsing #parsing: Generalised Recursive Descent parsing and Fellow-Determinism (AJ, ES), pp. 16–30.
CC-1998-MizushimaK: Storage Allocation Strategies for Recursive Attributes Evaluators (KM, TK), pp. 50–64.
ESOP-1998-Leino #logic #object-oriented #source code: Recursive Object Types in a Logic of Object-Oriented Programs (KRML), pp. 170–184.
LICS-1998-CattaniFW #concurrent #formal method: A Theory of Recursive Domains with Applications to Concurrency (GLC, MPF, GW), pp. 214–225.
LICS-1998-FioreH #axiom #game studies #process #representation: Recursive Types in Games: Axiomatics and Process Representation (MPF, KH), pp. 345–356.
LICS-1998-Viswanathan #abstraction #first-order #type system: Full Abstraction for First-Order Objects with Recursive Types and Subtyping (RV), pp. 380–391.
PODS-1997-DuschkaG #query #using: Answering Recursive Queries Using Views (OMD, MRG), pp. 109–116.
ITiCSE-1997-Proulx: Recursion and grammars for CS2 (VKP), pp. 74–76.
DLT-1997-RaskovaR #algebra #formal method: Recursive Constructions in the Theory of P.I. Algebras (TGR, PIR), pp. 559–566.
ICALP-1997-BeigelF #bound #nondeterminism #performance: Molecular Computing, Bounded Nondeterminism, and Efficient Recursion (RB, BF), pp. 816–826.
ICALP-1997-LathropL: Recursive Computational Depth (JIL, JHL), pp. 132–142.
TLCA-1997-BrandtH #axiom #induction #similarity #type system: Coinductive Axiomatization of Recursive Type Equality and Subtyping (MB, FH), pp. 63–81.
TLCA-1997-DespeyrouxPS #higher-order #syntax: Primitive Recursion for Higher-Order Abstract Syntax (JD, FP, CS), pp. 147–163.
TLCA-1997-Hasegawa #category theory #modelling #λ-calculus: Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic λ Calculi (MH), pp. 196–213.
ICFP-1997-Ostvold #functional #induction #source code #synthesis: Inductive Synthesis of Recursive Functional Programs (Poster Abstract) (BMØ), p. 323.
PEPM-1997-DanvyS #equation #named #source code #λ-calculus: λ-Dropping: Transforming Recursive Equations into Programs with Block Structure (OD, UPS), pp. 90–106.
PLILP-1997-GiavittoVM #compilation #semantics: Semantics and Compilation of Recursive Sequential Streams in 8½ (JLG, DDV, OM), pp. 207–223.
ASE-1997-ArmandoSG #automation #paradigm #source code #synthesis: Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm (AA, AS, IG), pp. 2–9.
SAC-1997-Sibai97b #distributed #network: Distributed routing in the recursive diamond network (FNS), pp. 389–392.
TAPSOFT-1997-Schreiber: Auxiliary Variables and Recursive Procedures (TS), pp. 697–711.
CSL-1997-Hofmann #linear #λ-calculus: A Mixed Modal/Linear λ Calculus with Applications to Bellantoni-Cook Safe Recursion (MH0), pp. 275–294.
CSL-1997-Moschovakis #concurrent #game studies #λ-calculus: A Game-Theoretic, Concurrent and Fair Model of the Typed λ-calculus, with Full Recursion (YNM), pp. 341–359.
CSL-1997-Voda #normalisation: A Simple Ordinal Recursive Normalization of Gödel’s T (PJV), pp. 491–509.
ICLP-1997-TorosluK #algorithm #effectiveness #maintenance: Effective Maintenance of Recursive Views: Improvements to the DRed Algorithm (IHT, FK), pp. 213–225.
ILPS-1997-TanL #analysis #logic programming #precise #source code: Recursive Modes for Precise Analysis of Logic Programs (JT, IPL), pp. 277–290.
LICS-1997-EscardoS #algebra #induction: Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras (MHE, TS), pp. 376–386.
ITiCSE-1996-WuLC #visualisation: Visualizing recursion and linked lists (CCW, JMCL, GFC), p. 232.
ICALP-1996-MitchellV #effectiveness #modelling #morphism #polymorphism #type system: Effective Models of Polymorphism, Subtyping and Recursion (JCM, RV), pp. 170–181.
RTA-1996-JouannaudR #higher-order #normalisation: A Recursive Path Ordering for Higher-Order Terms in η-Long β-Normal Form (JPJ, AR), pp. 108–122.
ICFP-1996-HuIT #morphism: Deriving Structural Hylomorphisms From Recursive Definitions (ZH, HI, MT), pp. 73–82.
CIKM-1996-Pulido #graph #query #traversal #using: Recursive Query Processing Using Graph Traversal Techniques (EP), pp. 37–44.
ICPR-1996-Aladjem #distance #optimisation: Two-class pattern discrimination via recursive optimization of Patrick-Fisher distance (MEA), pp. 60–64.
ICPR-1996-AmaraBCWML #estimation #parametricity #segmentation: A recursive estimation of parameters of straight lines and circles: application to the segmentation of the Rey’s Complex Figure (MA, DdB, PC, PW, CM, YL), pp. 467–471.
ICPR-1996-DistasiNV #image: A B-tree based recursive technique for image coding (RD, MN, SV), pp. 670–674.
ICPR-1996-MartinezST #linear #performance: A recursive updating rule for efficient computation of linear moments in sliding-window applications (JM, ES, FT), pp. 295–299.
ICPR-1996-WangFW: A recursive hierarchical scheme for radical extraction of handwritten Chinese characters (ABW, KCF, WHW), pp. 240–244.
KDD-1996-Lange #approach #empirical #predict #using: An Empirical Test of the Weighted Effect Approach to Generalized Prediction Using Recursive Neural Nets (RL), pp. 183–188.
ALP-1996-FassbenderM #decidability #strict: A Strict Border for the Decidability of E-Unification for Recursive Functions (HF, SM), pp. 194–208.
PLILP-1996-BenaissaLR #modelling #reduction #using: Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution (ZEAB, PL, KHR), pp. 393–407.
ASPLOS-1996-LukM #data type: Compiler-Based Prefetching for Recursive Data Structures (CKL, TCM), pp. 222–233.
PDP-1996-IazzettaSS #communication #network: Tree-Based Communication Model for WK-Recursive Networks (AI, CS, US), pp. 204–210.
TAPSOFT-J-1995-Sands96 #automation #correctness #program transformation #proving: Proving the Correctness of Recursion-Based Automatic Program Transformations (DS), pp. 193–233.
CADE-1996-HomeierM #verification: Mechanical Verification of Mutually Recursive Procedures (PVH, DFM), pp. 201–215.
CADE-1996-McAllesterA: Walther Recursion (DAM, KA), pp. 643–657.
JICSLP-1996-HamfeltN #declarative #logic programming: Declarative Logic Programming with Primitive Recursive Relations on Lists (AH, JFN), pp. 230–243.
LICS-1996-AbadiF: Syntactic Considerations on Recursive Types (MA, MPF), pp. 242–252.
LICS-1996-HirstH #complexity: More About Recursive Structures: Descriptive Complexity and Zero-One Laws (TH, DH), pp. 334–347.
ICDAR-v2-1995-ChenHP #documentation #image #segmentation #using #word: Simultaneous word segmentation from document images using recursive morphological closing transform (SSC, RMH, ITP), pp. 761–764.
ICDAR-v2-1995-HaHP #bound #component #using: Recursive X-Y cut using bounding boxes of connected components (JH, RMH, ITP), pp. 952–955.
ICDAR-v2-1995-Shieh: Recursive morphological sieve method for searching pictorial point symbols on maps (JSS), pp. 931–935.
FPLE-1995-Burton #concept: Conceptual Structures for Recursion (CTPB), pp. 179–193.
ICALP-1995-BestK #equation: Solving Recursive Net Equations (EB, MK), pp. 605–623.
RTA-1995-ChazarainM #automation #equation #named #source code #synthesis: LEMMA: A System for Automated Synthesis of Recursive Programs in Equational Theories (JC, SM), pp. 420–425.
RTA-1995-Holmes #equation #proving #theorem: Disguising Recursively Chained Rewrite Rules as Equational Theorems, as Implemented in the Prover EFTTP Mark 2 (MRH), pp. 432–437.
FPCA-1995-LaunchburyS: Warm Fusion: Deriving Build-Cata’s from Recursive Definitions (JL, TS), pp. 314–323.
FPCA-1995-Rittri #polymorphism: Dimension Inference Under Polymorphic Recursion (MR), pp. 147–159.
KDD-1995-TsumotoT #automation #induction #multi #statistics #testing: Automated Selection of Rule Induction Methods Based on Recursive Iteration of Resampling Methods and Multiple Statistical Testing (ST, HT), pp. 312–317.
PEPM-1995-Metayer #data type #proving #source code: Proving Properties of Programs Defined over Recursive Data Structures (DLM), pp. 88–99.
SAS-1995-DussartHM #analysis #polymorphism #polynomial #type system: Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time (DD, FH, CM), pp. 118–135.
HPDC-1995-JacobL #algorithm #performance #refinement: A Spanning Tree Based Recursive Refinement Algorithm for Fast Task Mapping (JCJ, SYL), pp. 58–65.
STOC-1995-KaplanT #persistent: Persistent lists with catenation via recursive slow-down (HK, RET), pp. 93–102.
TAPSOFT-1995-Sands #automation #correctness #program transformation #proving: Proving the Correctness of Recursion-Based Automatic Program Transformations (DS), pp. 681–695.
PODS-1994-ChaudhuriV #complexity #datalog #equivalence #on the #source code: On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 107–116.
ICALP-1994-CosmoK #algebra #first-order #term rewriting #λ-calculus: Combining First Order Algebraic Rewriting Systems, Recursion and Extensional λ Calculi (RDC, DK), pp. 462–472.
CHI-1994-Travers94b #interface: Recursive interfaces for reactive objects (MT), pp. 379–385.
ICML-1994-AhaLLM #learning #set: Learning Recursive Relations with Randomly Selected Small Training Sets (DWA, SL, CXL, SM), pp. 12–18.
KDD-1994-TsumotoT #estimation #probability: Selection of Probabilistic Measure Estimation Method Based on Recursive Iteration of Resampling Methods (ST, HT), pp. 121–132.
SEKE-1994-Pliuskeviciene #hoare #logic: Specialization of derivations in Hoare-like logic with recursive procedures (AP), pp. 124–130.
ICDAR-1993-Armand #approach #recognition: Musical score recognition: A hierarchical and recursive approach (JPA), pp. 906–909.
PODS-1993-Chaudhuri #datalog: Finding Nonrecursive Envelopes for Datalog Predicates (SC), pp. 135–146.
PODS-1993-HirstH #database: Completeness Results for Recursive Data Bases (TH, DH), pp. 244–252.
SIGMOD-1993-BeeriM #algebra #on the #power of: On the Power of Algebras with Recursion (CB, TM), pp. 377–386.
ICALP-1993-CosmoK #confluence #reduction #λ-calculus: A Confluent Reduction for the Extensional Typed λ-Calculus with Pairs, Sums, Recursion and terminal Object (RDC, DK), pp. 645–656.
RTA-1993-Raoult: Recursively Defined Tree Transductions (JCR), pp. 343–357.
TLCA-1993-Ghelli: Recursive Types Are not Conservative over F (GG), pp. 146–162.
TLCA-1993-Leiss: Combining Recursive and Dynamic Types (HL), pp. 258–273.
HCI-SHI-1993-StaesT #query #visual notation: OOQBE*: An Intuitive Graphical Query Language with Recursion (FS, LT), pp. 603–608.
ICML-1993-Idestam-Almquist #anti: Generalization under Implication by Recursive Anti-unification (PIA), pp. 151–158.
PLILP-1993-Nederhof #algorithm #definite clause grammar #parsing #top-down: A New Top-Down Parsing Algorithm for Left-Recursive DCGs (MJN), pp. 108–122.
POPL-1993-KozenPS #performance #type system: Efficient Recursive Subtyping (DK, JP, MIS), pp. 419–428.
POPL-1993-PierceT #object-oriented #programming: Object-Oriented Programming without Recursive Types (BCP, DNT), pp. 299–312.
WSA-1993-ChinK #multi #parametricity: Tupling Functions with Multiple Recursion Parameters (WNC, SCK), pp. 124–140.
SAC-1993-BerqueGE #algorithm #implementation: Implementing Progress Indicators for Recursive Algorithms (DAB, MKG, JAE), pp. 533–538.
TAPSOFT-1993-TiurynW #re-engineering #type system: Type Reconstruction with Recursive Types and Atomic Subtyping (JT, MW), pp. 686–701.
ICLP-1993-HarlandR #constraints #linear: Constraint Propagation for Linear Recursive Rules (JH, KR), pp. 683–699.
ILPS-1993-BerryE #generative #query: Generating Goals and Their Use In Recursive Query Processing (VB, PÉ), p. 649.
ILPS-1993-DevienneLR #decidability #horn clause #problem: The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable (PD, PL, JCR), pp. 250–265.
ILPS-1993-HanL #evaluation #source code: Evaluation of Regular Nonlinear Recursive Programs (JH, LVSL), p. 648.
PODS-1992-ChaudhuriV #datalog #equivalence #on the #source code: On the Equivalence of Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 55–66.
PODS-1992-GuptaM: Magic-sets Transformation in Nonrecursive Systems (AG, ISM), pp. 354–367.
SIGMOD-1992-LanzelotteVZ #object-oriented #optimisation #query #using: Optimization of Object-Oriented Recursive Queries using Cost-Controlled Strategies (RSGL, PV, MZ), pp. 256–265.
LFP-1992-Kaes #type inference #type system: Type Inference in the Presence of Overloading, Subtyping and Recursive Types (SK), pp. 193–204.
LFP-1992-WangH #analysis: Analysis of Recursive Types in Lisp-Like Languages (EW, PNH), pp. 216–225.
ML-1992-LapointeM #induction #named #performance #source code: Sub-unification: A Tool for Efficient Induction of Recursive Programs (SL, SM), pp. 273–281.
SEKE-1992-KimH #database #deduction #evaluation #parallel: Network-Based Simple Recursive Answer Evaluation for Deductive Databases in Parallel Environment (KK, LJH), pp. 63–70.
ALP-1992-Hermann #on the: On the Relation Between Primitive Recursion, Schematization and Divergence (MH), pp. 115–127.
PLDI-1992-HendrenHN #abstraction #analysis #data type #imperative #pointer #source code: Abstractions for Recursive Pointer Data Structures: Improving the Analysis of Imperative Programs (LJH, JH, AN), pp. 249–260.
POPL-1992-BruceM #higher-order #modelling #morphism #polymorphism #type system: PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism (KBB, JCM), pp. 316–327.
WSA-1992-Jensen #axiom #data type: Axiomatising Uniform Properties of Recursive Data Structures (TPJ), pp. 144–151.
STOC-1992-BellantoniC: A New Recursion-Theoretic Characterization of the Polytime Functions (SB, SAC), pp. 283–293.
CADE-1992-HeskethBS #reasoning #source code #synthesis #using: Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs (JH, AB, AS), pp. 310–324.
CSL-1992-AanderaaJ #linear #logic: Recursive Inseparability in Linear Logic (SA, HRJ), pp. 5–13.
JICSLP-1992-GrogerP #automation #logic programming #proving #source code #termination: Handling of Mutual Recursion in Automatic Termination Proofs for Logic Programs (GG, LP), pp. 336–350.
LICS-1992-Fribourg: Mixing List Recursion and Arithmetic (LF), pp. 419–429.
LICS-1992-Seth #axiom: There is No Recursive Axiomatization for Feasible Functionals of Type~2 (AS), pp. 286–295.
PODS-1991-Ross #composition #logic programming #source code: Modular Acyclicity and Tail Recursion in Logic Programs (KAR), pp. 92–101.
PODS-1991-SeshadriN #datalog #on the #query: On the Expected Size of Recursive Datalog Queries (SS, JFN), pp. 268–279.
ICALP-1991-Fernando #source code: Provably Recursive Programs and Program Extraction (TF), pp. 303–313.
VDME-1991-BednarczykB: CPO’s do not form a CPO, and yet Recursion Works (MAB, AMB), pp. 268–278.
LOPSTR-1991-LecoutreDL #abstract interpretation #behaviour #logic programming #source code: Abstract Interpretation and Recursive Behaviour of Logic Programs (CL, PD, PL), pp. 147–166.
PLILP-1991-GiannottiH #detection #specification: A Technique for Recursive Invariance Detection and Selective Program Specification (FG, MVH), pp. 323–334.
POPL-1991-AmadioC #type system: Subtyping Recursive Types (RMA, LC), pp. 104–118.
DAC-1991-KahngCR #geometry: High-Performance Clock Routing Based on Recursive Geometric Aatching (ABK, JC, GR), pp. 322–327.
ESOP-J-1990-Bondorf91 #automation #equation #higher-order: Automatic Autoprojection of Higher Order Recursive Equations (AB), pp. 3–34.
CSL-1991-Fernando #bisimulation #complexity #logic #set: A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation (TF), pp. 96–110.
CSL-1991-Leiss #algebra #towards: Towards Kleene Algebra with Recursion (HL), pp. 242–256.
ICLP-1991-Meier #prolog: Recursion versus Iteration in Prolog (MM), pp. 157–169.
ISLP-1991-LauP #product line #sorting #synthesis: Synthesis of a Family of Recursive Sorting Procedures (KKL, SDP), pp. 641–658.
LICS-1991-Mendler: Predicative Type Universes and Primitive Recursion (NPM), pp. 173–184.
PODS-1990-ConsensM #named #visual notation: GraphLog: a Visual Formalism for Real Life Recursion (MPC, AOM), pp. 404–416.
PODS-1990-Plambeck #optimisation #query: Semigroup Techniques in Recursive Query Optimization (TEP), pp. 145–153.
VDME-1990-BednarczykBP #revisited: Recursive Definitions Revisited (MAB, AMB, WP), pp. 452–476.
LFP-1990-Hanson #performance #stack: Efficient Stack Allocation for Tail-Recursive Languages (CH), pp. 106–118.
GG-1990-Bauderon #equation: General Solution to a System of Recursive Equations (MB), pp. 113–126.
SEKE-1990-Al-SukairiH #compilation #independence #linear: Query-Independent Compilation of Linear Recursions (AAS, LJH), pp. 177–182.
ALP-1990-Han #graph #query: Recursive Query Processing in Predicate-Goal Graph (JLH), pp. 247–261.
ALP-1990-Hofbauer #multi #order #proving #termination: Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths (DH), pp. 347–358.
CC-1990-Horspool #parsing: Recursive Ascent-Descent Parsers (RNH), pp. 1–10.
ESOP-1990-Bondorf #automation #equation #higher-order: Automatic Autoprojection of Higher Order Recursive Equations (AB), pp. 70–87.
CLP-1990-LauP90 #first-order #logic #specification #synthesis #top-down: Top-down Synthesis of Recursive Logic Procedures from First-order Logic Specifications (KKL, SDP), pp. 667–684.
LICS-1990-AbadiP #morphism #polymorphism: A Per Model of Polymorphism and Recursive Types (MA, GDP), pp. 355–365.
LICS-1990-Freyd #induction: Recursive Types Reduced to Inductive Types (PJF), pp. 498–507.
PODS-1989-Bonner #datalog #linear: Hypothetical Datalog: Negation and Linear Recursion (AJB), pp. 286–300.
PODS-1989-Cosmadakis #first-order #on the #query: On the First-Order Expressibility of Recursive Queries (SSC), pp. 311–323.
PODS-1989-Saraiya #polynomial: Linearizing Nonlinear Recursions in Polynomial Time (YPS), pp. 182–189.
SIGMOD-1989-Colby #algebra #optimisation #query: A Recursive Algebra and Query Optimization for Nested Relations (LSC), pp. 273–283.
SIGMOD-1989-LarsonD #traversal: A File Structure Supporting Traversal Recursion (PÅL, VD), pp. 243–252.
VLDB-1989-Hulin #architecture #distributed #parallel #query: Parallel Processing of Recursive Queries in Distributed Architectures (GH), pp. 87–96.
VLDB-1989-Ioannidis #commutative #linear: Commutativity and its Role in the Processing of Linear Recursion (YEI), pp. 155–163.
ICALP-1989-Cardone #bound #quantifier #relational #semantics: Relational Semantics for Recursive Types and Bounded Quantification (FC), pp. 164–178.
ICALP-1989-Colson #algorithm: About Primitive Recursive Algorithms (LC), pp. 194–206.
RTA-1989-Puel #order: Embedding with Patterns and Associated Recursive Path Ordering (LP), pp. 371–387.
FPCA-1989-Lester #architecture #compilation #distributed #named: Stacklessness: Compiling Recursion for a Distributed Architecture (DRL), pp. 116–128.
ML-1989-LambertTL #algorithm #concept #hybrid #learning: Generalized Recursive Splitting Algorithms for Learning Hybrid Concepts (BLL, DKT, SCYL), pp. 496–498.
SEKE-1989-Czejdo #database #query #specification #using: Recursive Query Specification Using Nested Databases (BDC), pp. 140–145.
STOC-1989-AfratiC #query #strict: Expressiveness of Restricted Recursive Queries (FNA, SSC), pp. 113–126.
CSL-1989-Ambos-SpiesY #polynomial #set: Honest Polynomial-Time Degrees of Elementary Recursive Sets (KAS, DY), pp. 1–15.
CSL-1989-Leiss #polymorphism: Polymorphic Recursion and Semi-Unification (HL), pp. 211–224.
CSL-1989-Wette #complexity #representation: Sequential Representation of Primitive Recursive Functions, and Complexity Classes (EW), pp. 422–437.
LICS-1989-AbadiPP #modelling #polymorphism: Faithful Ideal Models for Recursive Polymorphic Types (MA, BCP, GDP), pp. 216–225.
LICS-1989-Cosmadakis: Computing with Recursive Types (SSC), pp. 24–38.
LICS-1989-Fernando #on the #set: On Substitutional Recursion Over Non-Well-Founded Sets (RTPF), pp. 273–282.
LICS-1989-Goerdt #complexity: Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions (AG), pp. 364–374.
NACLP-1989-HanL #linear #multi: Processing Multiple Linear Recursions (JH, LL), pp. 816–830.
PODS-1988-Vardi #bound #decidability #linear #query: Decidability and Undecidability Results for Boundedness of Linear Recursive Queries (MYV), pp. 341–351.
SIGMOD-1988-Naughton #compilation: Compiling Separable Recursions (JFN), pp. 312–319.
SIGMOD-1988-YounHH #classification #database #deduction: Classification of Recursive Formulas in Deductive Databases (CY, LJH, JH), pp. 320–328.
VDME-1988-Haxthausen #algebra #equation: Mutually Recursive Algebraic Domain Equations (AEH), pp. 299–317.
ALP-1988-Pasztor #logic #semantics #source code #standard: Nonstandard Logics of Recursive Programs and Denotational Semantics (AP), pp. 255–278.
DAC-1988-HeynsN: Recursive Channel Router (WH, KVN), pp. 178–182.
CADE-1988-ChiH #horn clause #query: Recursive Query Answering with Non-Horn Clauses (SC, LJH), pp. 294–312.
CSL-1988-Goerdt #complexity: Characterizing Complexity Classes by General Recursive Definitions in Higher Types (AG), pp. 99–117.
LICS-1988-ConstableS: Computational Foundations of Basic Recursive Function Theory (RLC, SFS), pp. 360–371.
LICS-1988-KfouryTU #on the #polymorphism #power of: On the Computational Power of Universally Polymorphic Recursion (AJK, JT, PU), pp. 72–81.
PODS-1987-GrahneSS #evaluation #performance #query #set: Efficient Evaluation for a Subset of Recursive Queries (GG, SS, ESS), pp. 284–293.
PODS-1987-Naughton: One-Sided Recursions (JFN), pp. 340–348.
PODS-1987-NaughtonS #bound #decidability: A Decidable Class of Bounded Recursions (JFN, YS), pp. 227–236.
PODS-1987-RamakrishnanBS #horn clause #infinity #safety: Safety of Recursive Horn Clauses With Infinite Relations (RR, FB, AS), pp. 328–339.
SIGMOD-1987-CruzMW #query #visual notation: A Graphical Query Language Supporting Recursion (IFC, AOM, PTW), pp. 323–330.
SIGMOD-1987-HanH #database #query: Handling Redundancy in the Processing of Recursive Database Queries (JH, LJH), pp. 73–81.
SIGMOD-1987-JagadishAN #case study #transitive: A Study of Transitive Closure As a Recursion Mechanism (HVJ, RA, LN), pp. 331–344.
SIGMOD-1987-ZhangY #linear: A Necessary Condition for a Doubly Recursive Rule to be Equivalent to a Linear Recursive Rule (WZ, CTY), pp. 345–356.
VLDB-1987-Gardarin #datalog #source code: Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs (GG), pp. 21–30.
VLDB-1987-Nejdl #query: Recursive Strategies for Answering Recursive Queries — The RQA/FQI Strategy (WN), pp. 43–50.
VLDB-1987-WhangN #approach #logic #normalisation #optimisation #query: An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments (KYW, SBN), pp. 275–287.
PLDI-1987-OBagyG #interpreter #programming language: A recursive interpreter for the Icon programming language (JO, REG), pp. 138–149.
CAAP-1987-Parisi-Presicce #composition #specification: Partial Composition and Recursion of Module Specifications (FPP), pp. 217–231.
ICLP-1987-SaccaZ87 #implementation #logic #query: Implementation of Recursive Queries for a Data Language Based on Pure Horn Logic (DS, CZ), pp. 104–135.
LICS-1987-Mendler #constraints #higher-order #λ-calculus: Recursive Types and Type Constraints in Second-Order λ Calculus (NPM), pp. 30–36.
PODS-1986-CosmadakisK #evaluation #parallel #query: Parallel Evaluation of Recursive Rule Queries (SSC, PCK), pp. 280–293.
PODS-1986-Naughton #database #deduction #independence: Data Independent Recursion in Deductive Databases (JFN), pp. 267–279.
SIGMOD-1986-BancilhonR #query: An Amateur’s Introduction to Recursive Query Processing Strategies (FB, RR), pp. 16–52.
SIGMOD-1986-GardarinM #database #evaluation #logic programming #source code: Evaluation of Database Recursive Logic Programs as Recurrent Function Series (GG, CdM), pp. 177–186.
SIGMOD-1986-RosenthalHDM #approach #traversal: Traversal Recursion: A Practical Approach to Supporting Recursive Applications (AR, SH, UD, FM), pp. 166–176.
VLDB-1986-KrishnamurthyBZ #optimisation #query: Optimization of Nonrecursive Queries (RK, HB, CZ), pp. 128–137.
VLDB-1986-RaschidS #parallel #query: A Parallel Processing Strategy for Evaluating Recursive Queries (LR, SYWS), pp. 412–419.
ICALP-1986-Schoning #bound: Lower Bounds by Recursion Theoretic Arguments (US), pp. 370–375.
GG-1986-HotzKM #algebra #equation #network #on the: On Network Algebras and Recursive Equations (GH, RK, PM), pp. 250–261.
DAC-1986-ClarkeF #geometry #layout #named: Escher — a geometrical layout system for recursively defined circuits (EMC, YF), pp. 650–653.
ESOP-1986-Bohm #algebra: Reducing Recursion to Iteration by Algebraic Extension (CB), pp. 111–118.
CADE-1986-Weispfenning #logic #source code: Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs (VW), pp. 564–571.
LICS-1986-Plaisted #nondeterminism #semantics #source code #using: The Denotional Semantics of Nondeterministic Recursive Programs using Coherent Relations (DAP), pp. 163–174.
SLP-1986-Naughton86: Redundancy in Function-Free Recursive Rules (JFN), pp. 236–245.
VLDB-1985-HeilerR #functional #interface #visual notation: G-WHIZ, a Visual Interface for the Functional Model with Recursion (SH, AR), pp. 209–218.
VLDB-1985-Ioannidis #bound: A Time Bound on the Materialization of some Recursively Defined Views (YEI), pp. 219–226.
ICALP-1985-Coppo #theorem: A Completeness Theorem for Recursively Defined Types (MC), pp. 120–129.
RTA-1985-Rusinowitch #composition #revisited: Path of Subterms Ordering and Recursive Decomposition Ordering Revisited (MR), pp. 225–240.
FPCA-1985-BushG85 #execution #parallel #source code: Transforming Recursive Programs for Execution on Parallel Machines (VJB, JRG), pp. 350–367.
FPCA-1985-Debray85 #optimisation #prolog #source code: Optimizing Almost-Tail-Recursive Prolog Programs (SKD), pp. 204–219.
FPCA-1985-Johnsson85 #equation #source code: λ Lifting: Treansforming Programs to Recursive Equations (TJ), pp. 190–203.
SLP-1985-SawamuraT85 #optimisation #prolog: Recursive Unsolvability of Determinacy, Solvable Cases of Determinancy and their Applications to Prolog Optimization (HS, TT), pp. 200–207.
ICALP-1984-BergstraK #algebra #process: The Algebra of Recursively Defined Processes and the Algebra of Regular Processes (JAB, JWK), pp. 82–94.
ICALP-1984-KirschenhoferP #algorithm #analysis #traversal: Recursion Depth Analysis for Special Tree Traversal Algorithms (PK, HP), pp. 303–311.
LFP-1984-Saint-James #performance: Recursion is More Efficient than Iteration (ESJ), pp. 228–234.
POPL-1984-MacQueenPS #polymorphism: An Ideal Model for Recursive Polymorphic Types (DBM, GDP, RS), pp. 165–174.
SCC-1984-Jourdan #attribute grammar: Strongly non-circular attribute grammars and their recursive evaluation (MJ), pp. 81–93.
CADE-1984-Mulmuley #proving: The Mechanization of Existence Proofs of Recursive Predicates (KM), pp. 460–475.
ICALP-1983-BakkerBKM #branch #linear #semantics: Linear Time and Branching Time Semantics for Recursion with Merge (JWdB, JAB, JWK, JJCM), pp. 39–51.
ICALP-1982-Schmeck #algebra #semantics: Algebraic Semantics of Recursive Flowchart Schemes (HS), pp. 489–501.
POPL-1982-JonesM #analysis #approach #data flow #data type #flexibility #interprocedural #source code: A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures (NDJ, SSM), pp. 66–74.
POPL-1982-MeyerM #axiom #source code: Axiomatic Definability and Completeness for Recursive Programs (ARM, JCM), pp. 337–346.
CADE-1982-HenschenN #database #first-order #infinity #representation #sequence: Representing Infinite Sequences of Resolvents in recursive First-Order Horn Databases (LJH, SAN), pp. 342–359.
ICALP-1981-Pettorossi #order #proving #term rewriting #termination: Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems (AP), pp. 432–447.
PS-1981-Klaeren #algebra: Recursive Definitions of Operations in Universal Algebras (HK), pp. 268–281.
CADE-1980-Kott #proving #source code: A System for Proving Equivalences of Recursive Programs (LK), pp. 63–69.
ICALP-1979-Gallier: Recursion Schemes and Generalized Interpretations (JHG), pp. 256–270.
ICALP-1979-Istrail #fixpoint #monad #semantics #source code #theorem: A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs (SI), pp. 289–303.
ICALP-1979-Nijholt: Structure Preserving Transformations on Non-Left-Recursive Grammars (AN), pp. 446–459.
POPL-1979-Cohen #source code: Characterization and Elimination of Redundancy in Recursive Programs (NHC), pp. 143–157.
POPL-1979-Harel #logic #source code: Recursion in Logics of Programs (DH), pp. 81–92.
POPL-1979-SavageS #linear #trade-off: Space-Time Tradeoffs for Linear Recursion (SS, JES), pp. 135–142.
SCC-1979-Pleban #compilation #matrix #using: The use of transition matrices in a recursive-descent compiler (UFP), pp. 144–151.
ICALP-1978-DammF #on the #power of #self: On the Power of Self-Application and Higher Type-Recursion (WD, EF), pp. 177–191.
ICALP-1978-Gallier #correctness #nondeterminism #semantics #source code: Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures (JHG), pp. 251–267.
ICALP-1978-Mignotte #effectiveness #linear #sequence: Some Effective Results About Linear Recursive Sequences (MM), pp. 322–329.
GG-1978-ArbibM #algebra #monad #semantics: Partially-Additive Monoids, Graph-Growing, and the Algebraic Semantics of Recursive Calls (MAA, EGM), pp. 127–138.
POPL-1978-Oppen #data type #reasoning: Reasoning about Recursively Defined Data Structures (DCO), pp. 151–157.
STOC-1978-Kozen: Indexing of Subrecursive Classes (DK), pp. 287–295.
STOC-1978-RaoultV #equivalence #semantics #source code: Operational and Semantic Equivalence between Recursive Programs (JCR, JV), pp. 75–85.
ICALP-1977-BertoniMT #automaton #probability #problem: Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata (AB, GM, MT), pp. 87–94.
POPL-1977-BerryL #source code: Minimal and Optimal Computations of Recursive Programs (GB, JJL), pp. 215–226.
POPL-1977-Nijholt #on the: On the Covering of Left Recursive Grammars (AN), pp. 86–96.
STOC-1977-HarelPS #axiom #deduction #proving #source code: A Complete Axiomatic System for Proving Deductions about Recursive Programs (DH, AP, JS), pp. 249–260.
STOC-1977-ODonnell #combinator #equation #lisp #logic #program transformation: Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic (MO), pp. 295–305.
ICALP-1976-Bakker #nondeterminism #semantics #source code #termination: Semantics and Termination of Nondeterministic Recursive Programs (JWdB), pp. 435–477.
POPL-1976-BoyerMS #program transformation: Primitive Recursive Program Transformations (RSB, JSM, RES), pp. 171–174.
SOSP-1975-BelpaireN #architecture #virtual machine: Formal Properties of Recursive Virtual Machine Architectures (GB, NTH), pp. 89–96.
STOC-1975-MannaS #source code: The Optimal Fixedpoint of Recursive Programs (ZM, AS), pp. 194–206.
ICALP-1974-Ausiello #complexity #semantics #source code: Relations between Semantics and Complexity of Recursive Programs (GA), pp. 129–140.
ICALP-1974-CourcelleKV #equation #equivalence #french #reduction: Algorithmes d’equivalence et de reduction a des expressions minimales dans une classe d’equations recursives simples (BC, GK, JV), pp. 200–213.
ICALP-1974-Mehlhorn #decidability: The “Almost All” Theory of Subrecursive Degrees is Decidable (KM), pp. 317–325.
ICALP-1974-Monien #bound: Characterizations of Time-Bounded Computations by Limited Primitive Recursion (BM), pp. 280–293.
ICALP-1974-PaciniMT #graph #representation: Graph Representation and Computation Rules for Typeless Recursive Languages (GP, CM, FT), pp. 157–169.
ICALP-1974-Roever #approach #axiom #parametricity: Recursion and Parameter Mechanisms: An Axiomatic Approach (WPdR), pp. 34–65.
STOC-1974-CourcelleV #axiom #semantics: Semantics and Axiomatics of a Simple Recursive Language (BC, JV), pp. 13–26.
STOC-1974-Mehlhorn #polynomial: Polynomial and Abstract Subrecursive Classes (KM), pp. 96–109.
POPL-1973-LewisR #data type: Recursively Defined Data Types (CHL, BKR), pp. 125–138.
STOC-1973-Vuillemin #implementation #programming language: Correct and Optimal Implementations of Recursion in a Simple Programming Language (JV), pp. 224–239.
ICALP-1972-BakkerR #calculus: A Calculus for Recursive Program Schemes (JWdB, WPdR), pp. 167–196.
ICALP-1972-HenkeIW #automaton: Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata (FWvH, KI, KW), pp. 549–561.
ICALP-1972-Wand #approach: A Concrete Approach to Abstract Recursion Definitions (MW), pp. 331–341.
STOC-1972-ConstableM #decidability #equivalence #problem: Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems (RLC, SSM), pp. 1–17.
STOC-1972-Morris: Recursion Schemes with Lists (JHMJ), pp. 35–43.
STOC-1972-WalkerS: Characterization of Flowchartable Recursions (SAW, HRS), pp. 18–34.
STOC-1971-GinsburgG: Intersection-Closed full AFL and the Recursively Enumerable Languages (SG, JG), pp. 121–131.
STOC-1971-Machtey #classification: Classification of Computable Functions by Primitive Recursive Classes (MM), pp. 251–257.
STOC-1971-Robertson #complexity: Complexity Classes of Partial Recursive Functions (ELR), pp. 258–266.
STOC-1971-Wagner #algebra: An Algebraic Theory of Recursive Definitions and Recursive Languages (EGW), pp. 12–23.
STOC-1970-Constable #on the #source code: On the Size of Programs in Subrecursive Formalisms (RLC), pp. 1–9.
STOC-1970-LandweberR #complexity: Recursive Properties of Abstract Complexity Classes (LHL, ELR), pp. 31–36.
STOC-1970-Strong #equation: Translating Recursion Equations into Flow Charts (HRSJ), pp. 184–197.
STOC-1969-Borodin #complexity: Complexity Classes of Recursive Functions and the Existence of Complexity Gaps (AB), pp. 67–78.
STOC-1969-MannaP #formal method: Formalization of Properties of Recursively Defined Functions (ZM, AP), pp. 201–210.