BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
order (491)
program (104)
logic (83)
type (63)
function (60)

Stem higher$ (all stems)

557 papers:

WICSAWICSA-2015-BangM #design #detection #higher-order
Proactive Detection of Higher-Order Software Design Conflicts (JYB, NM), pp. 155–164.
PEPMPEPM-2015-BransenDS #evaluation #higher-order #incremental
Incremental Evaluation of Higher Order Attributes (JB, AD, SDS), pp. 39–48.
PEPMPEPM-2015-KootH #analysis #exception #functional #higher-order #semantics #strict #type system
Type-based Exception Analysis for Non-strict Higher-order Functional Languages with Imprecise Exception Semantics (RK, JH), pp. 127–138.
PEPMPEPM-2015-VerstoepH #analysis #functional #higher-order #strict
Polyvariant Cardinality Analysis for Non-strict Higher-order Functional Languages: Brief Announcement (HV, JH), pp. 139–142.
PLDIPLDI-2015-NguyenH #higher-order #source code
Relatively complete counterexamples for higher-order programs (PCN, DVH), pp. 446–456.
ICFPICFP-2015-AvanziniLM #complexity #first-order #functional #higher-order #source code
Analysing the complexity of functional programs: higher-order meets first-order (MA, UDL, GM), pp. 152–164.
ICFPICFP-2015-KeilT #contract #higher-order
Blame assignment for higher-order contracts with intersection and union (MK, PT), pp. 375–386.
ICFPICFP-2015-NeisHKMDV #compilation #higher-order #imperative #named
Pilsner: a compositionally verified compiler for a higher-order imperative language (GN, CKH, JOK, CM, DD, VV), pp. 166–178.
HCISCSM-2015-WangM #bibliography #education #perspective #social #social media
Social Media and Higher Education: A Literature Review (YW, GM), pp. 96–104.
ECIRECIR-2015-HuynhHR #analysis #learning #sentiment #strict
Learning Higher-Level Features with Convolutional Restricted Boltzmann Machines for Sentiment Analysis (TH, YH, SMR), pp. 447–452.
ECOOPECOOP-2015-KeilT #contract #higher-order #named
TreatJS: Higher-Order Contracts for JavaScripts (MK, PT), pp. 28–51.
PPDPPPDP-2015-StievenartNMR #abstract interpretation #concurrent #debugging #detection #higher-order #source code
Detecting concurrency bugs in higher-order programs through abstract interpretation (QS, JN, WDM, CDR), pp. 232–243.
POPLPOPL-2015-BartheGAHRS #approximate #design #difference #higher-order #privacy #refinement #relational
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy (GB, MG, EJGA, JH, AR, PYS), pp. 55–68.
POPLPOPL-2015-Sojakova #algebra #induction
Higher Inductive Types as Homotopy-Initial Algebras (KS), pp. 31–42.
ICSEICSE-v1-2015-MilicevicNKJ #constraints #higher-order #relational #theorem proving
Alloy*: A General-Purpose Higher-Order Relational Constraint Solver (AM, JPN, EK, DJ), pp. 609–619.
CGOCGO-2015-LeissaKH #graph #higher-order #representation
A graph-based higher-order intermediate representation (RL, MK, SH), pp. 202–212.
CAVCAV-2015-OulamaraV #abstract interpretation
Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation (MO, AJV), pp. 415–430.
CAVCAV-2015-KuwaharaSU0 #abstraction #functional #higher-order #source code #termination
Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs (TK, RS, HU, NK), pp. 287–303.
CSLCSL-2015-Berardi #comprehension #higher-order #induction
Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness (SB), pp. 343–358.
CSLCSL-2015-CapriottiKV
Functions out of Higher Truncations (PC, NK, AV), pp. 359–373.
CSLCSL-2015-GrelloisM #higher-order #linear #logic #model checking #relational #semantics
Relational Semantics of Linear Logic and Higher-order Model Checking (CG, PAM), pp. 260–276.
CSLCSL-2015-SalvatiW #behaviour #higher-order #source code
A Model for Behavioural Properties of Higher-order Programs (SS, IW), pp. 229–243.
ICLPICLP-2015-Hallen #data mining #higher-order #logic #mining #specification
Higher Order Support in Logic Specification Languages for Data Mining Applications (MvdH).
LICSLICS-2015-Ong #bibliography #higher-order #model checking #perspective
Higher-Order Model Checking: An Overview (LO), pp. 1–15.
ASEASE-2014-HarmanJMP #effectiveness #empirical #higher-order #performance
Angels and monsters: an empirical investigation of potential test effectiveness and efficiency improvement from strongly subsuming higher order mutation (MH, YJ, PRM, MP), pp. 397–408.
ESOPESOP-2014-KuwaharaTU0 #automation #functional #higher-order #source code #termination #verification
Automatic Termination Verification for Higher-Order Functional Programs (TK, TT, HU, NK), pp. 392–411.
ESOPESOP-2014-YoshimizuHFL #higher-order #metric #proving #quantum
Measurements in Proof Nets as Higher-Order Quantum Circuits (AY, IH, CF, UDL), pp. 371–391.
PEPMPEPM-J-2013-WeijersHH14 #fault #higher-order #polymorphism #security
Security type error diagnosis for higher-order, polymorphic languages (JW, JH, SH), pp. 200–218.
PLDIPLDI-2014-CaiGRO #difference #formal method #higher-order #λ-calculus
A theory of changes for higher-order languages: incrementalizing λ-calculi by static differentiation (YC, PGG, TR, KO), p. 17.
FLOPSFLOPS-2014-YallopW #lightweight #morphism #polymorphism
Lightweight Higher-Kinded Polymorphism (JY, LW), pp. 119–135.
ICALPICALP-v2-2014-PlaceZ #first-order #quantifier #word
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words (TP, MZ), pp. 342–353.
FMFM-2014-ZeydaSCS #composition #higher-order #object-oriented
A Modular Theory of Object Orientation in Higher-Order UTP (FZ, TLVLS, AC, AS), pp. 627–642.
ICFPICFP-2014-BergstromFLRS #effectiveness #higher-order #optimisation
Practical and effective higher-order optimizations (LB, MF, ML, JHR, NS), pp. 81–93.
ICFPICFP-2014-KakiJ #analysis #framework #higher-order #relational
A relational framework for higher-order shape analysis (GK, SJ), pp. 311–324.
IFLIFL-2014-FredrikssonGW #higher-order #towards
Towards native higher-order remote procedure calls (OF, DRG, BW), p. 10.
GT-VMTGT-VMT-2014-DeckwerthV #constraints #generative #graph transformation #higher-order
Generating Preconditions from Graph Constraints by Higher Order Graph Transformation (FD, GV).
HCIHIMI-DE-2014-KimitaNS #analysis #education
Application of a Requirement Analysis Template to Lectures in a Higher Education Institution (KK, YN, YS), pp. 594–601.
HCILCT-NLE-2014-ElciD #approach #case study #education #experience #research #social #social media
A Narrative Research Approach: The Experiences of Social Media Support in Higher Education (AE, BÇD), pp. 36–42.
HCILCT-NLE-2014-MeskeSVRO #case study #education
Cloud Storage Services in Higher Education — Results of a Preliminary Study in the Context of the Sync&Share-Project in Germany (CM, SS, RV, DR, ), pp. 161–171.
ICPRICPR-2014-GhoraiC #algorithm #composition #higher-order #image #using
An Image Inpainting Algorithm Using Higher Order Singular Value Decomposition (MG, BC), pp. 2867–2872.
KRKR-2014-CharalambidisR #higher-order #logic programming
Constructive Negation in Extensional Higher-Order Logic Programming (AC, PR).
ECOOPECOOP-2014-OkurED #abstraction #low level #parallel
Converting Parallel Code from Low-Level Abstractions to Higher-Level Abstractions (SO, CE, DD), pp. 515–540.
PPDPPPDP-2014-Schopp #low level #source code #using
Organising Low-Level Programs using Higher Types (US), pp. 199–210.
PPDPPPDP-2014-StulovaMH #debugging #higher-order #source code
Assertion-based Debugging of Higher-Order (C)LP Programs (NS, JFM, MVH), pp. 225–235.
POPLPOPL-2014-Birkedal #composition #concurrent #higher-order #imperative #reasoning #source code
Modular reasoning about concurrent higher-order imperative programs (LB), pp. 1–2.
POPLPOPL-2014-LagoSA #functional #higher-order #induction #on the #probability #source code
On coinductive equivalences for higher-order probabilistic functional programs (UDL, DS, MA), pp. 297–308.
POPLPOPL-2014-PaganiSV #higher-order #quantum #semantics
Applying quantitative semantics to higher-order quantum computing (MP, PS, BV), pp. 647–658.
POPLPOPL-2014-RamsayNO #abstraction #approach #higher-order #model checking #refinement
A type-directed abstraction refinement approach to higher-order model checking (SJR, RPN, CHLO), pp. 61–72.
POPLPOPL-2014-SergeyVJ #analysis #composition #higher-order #theory and practice
Modular, higher-order cardinality analysis in theory and practice (IS, DV, SLPJ), pp. 335–348.
SLESLE-J-2012-KrishnanW #analysis #attribute grammar #composition #higher-order #termination
Monolithic and modular termination analyses for higher-order attribute grammars (LK, EVW), pp. 511–526.
ICLPICLP-J-2014-CharalambidisER #higher-order #logic programming #semantics
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation (AC, , PR), pp. 725–737.
IJCARIJCAR-2014-Lindblad #calculus #higher-order #logic
A Focused Sequent Calculus for Higher-Order Logic (FL), pp. 61–75.
LICSLICS-CSL-2014-BernardoSV #higher-order #interactive #on the #power of
On the discriminating power of passivation and higher-order interaction (MB, DS, VV), p. 10.
LICSLICS-CSL-2014-TsukadaO #composition #game studies #higher-order #model checking
Compositional higher-order model checking via ω-regular games over Böhm trees (TT, CHLO), p. 10.
SIGMODSIGMOD-2013-WhangYYSKK #approach #named #parallel #using
ODYS: an approach to building a massively-parallel search engine using a DB-IR tightly-integrated parallel DBMS for higher-level functionality (KYW, TSY, YMY, IYS, HYK, IJK), pp. 313–324.
ESOPESOP-2013-KobayashiI #higher-order #model checking #recursion #source code
Model-Checking Higher-Order Programs with Recursive Types (NK, AI), pp. 431–450.
ESOPESOP-2013-ToninhoCP #higher-order #integration #monad #process
Higher-Order Processes, Functions, and Sessions: A Monadic Integration (BT, LC, FP), pp. 350–369.
FoSSaCSFoSSaCS-2013-Czajka #higher-order #logic #recursion
Partiality and Recursion in Higher-Order Logic (LC0), pp. 177–192.
PEPMPEPM-2013-SatoUK #higher-order #model checking #scalability #source code #towards
Towards a scalable software model checker for higher-order programs (RS, HU, NK), pp. 53–62.
PEPMPEPM-2013-WeijersHH #fault #higher-order #polymorphism #security
Security type error diagnosis for higher-order, polymorphic languages (JW, JH, SH), pp. 3–12.
PLDIPLDI-2013-SwamyWSCL #higher-order #monad #source code #verification
Verifying higher-order programs with the dijkstra monad (NS, JW, CS, JC, BL), pp. 387–398.
STOCSTOC-2013-ChonevOW #problem
The orbit problem in higher dimensions (VC, JO, JW), pp. 941–950.
STOCSTOC-2013-KwokLLGT #algorithm #analysis #clustering #difference #higher-order
Improved Cheeger’s inequality: analysis of spectral partitioning algorithms through higher order spectral gap (TCK, LCL, YTL, SOG, LT), pp. 11–20.
ICALPICALP-v1-2013-BohlerCKLPZ #complexity #diagrams #higher-order #on the
On the Complexity of Higher Order Abstract Voronoi Diagrams (CB, PC, RK, CHL, EP, MZ), pp. 208–219.
LATALATA-2013-Ong #automaton #higher-order #model checking #recursion
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking (LO), pp. 13–41.
ICFPICFP-2013-AxelssonC #functional #higher-order #source code #syntax #using
Using circular programs for higher-order syntax: functional pearl (EA, KC), pp. 257–262.
ICFPICFP-2013-BroadbentCHS #approach #higher-order #named #verification
C-SHORe: a collapsible approach to higher-order verification (CHB, AC, MH, OS), pp. 13–24.
ICFPICFP-2013-DunfieldK #bidirectional #morphism #polymorphism #rank
Complete and easy bidirectional typechecking for higher-rank polymorphism (JD, NRK), pp. 429–442.
ICFPICFP-2013-Krishnaswami #functional #higher-order #programming
Higher-order functional reactive programming without spacetime leaks (NRK), pp. 221–232.
ICFPICFP-2013-TuronDB #concurrent #higher-order #hoare #logic #reasoning #refinement
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency (AT, DD, LB), pp. 377–390.
HCIDHM-HB-2013-ZhaoLZ #analysis #higher-order #statistics
Higher Order Statistics Analyses Based on the Mathematical Model of Surface Electromyography (YZ, DL, JZ), pp. 402–408.
HCIOCSC-2013-MirandaICP #education #student #web
WEB 2.0 Technologies Supporting Students and Scholars in Higher Education (PM, PTI, CJC, SP), pp. 191–200.
HCIOCSC-2013-StieglitzES #behaviour #education #learning #student
Influence of Monetary and Non-monetary Incentives on Students’ Behavior in Blended Learning Settings in Higher Education (SS, AE, MS), pp. 104–112.
KDIRKDIR-KMIS-2013-SilvaPS #education
A Decision Support System for Portuguese Higher Education Course Selection — First Round (JPS, FP, MFS), pp. 360–367.
KDIRKDIR-KMIS-2013-SvobodaC #case study #education #experience
Customer Satisfaction and Loyalty in Higher Education — A Case Study over a Five-Year Academic Experience (PS, JC), pp. 431–436.
ECOOPECOOP-2013-MaierO #higher-order #incremental #programming
Higher-Order Reactive Programming with Incremental Lists (IM, MO), pp. 707–731.
ECOOPECOOP-2013-SvendsenBP #case study #composition #concurrent #higher-order #library #named #specification
Joins: A Case Study in Modular Specification of a Concurrent Reentrant Higher-Order Library (KS, LB, MJP), pp. 327–351.
PPDPPPDP-2013-WangCGN #higher-order #reasoning #relational #specification
Reasoning about higher-order relational specifications (YW, KC, AG, GN), pp. 157–168.
POPLPOPL-2013-UnnoTK #automation #functional #higher-order #source code #verification
Automating relatively complete verification of higher-order functional programs (HU, TT, NK), pp. 75–86.
ESEC-FSEESEC-FSE-2013-PetkeYCH #combinator #detection #fault #interactive #performance #testing
Efficiency and early fault detection with lower and higher strength combinatorial interaction testing (JP, SY, MBC, MH), pp. 26–36.
SLESLE-2013-SoderbergH #attribute grammar #higher-order
Circular Higher-Order Reference Attribute Grammars (ES, GH), pp. 302–321.
ASPLOSASPLOS-2013-XiangDLB #higher-order #locality #named
HOTL: a higher order theory of locality (XX, CD, HL, BB), pp. 343–356.
CSLCSL-2013-BroadbentK #higher-order #model checking #recursion
Saturation-Based Model Checking of Higher-Order Recursion Schemes (CHB, NK), pp. 129–148.
RTARTA-2013-BaumgartnerKLV #anti #higher-order
A Variant of Higher-Order Anti-Unification (AB, TK, JL, MV), pp. 113–127.
CASECASE-2012-IsmailDH #higher-order #using
Observer-based trajectory tracking for a class of underactuated Lagrangian systems using higher-order sliding modes (RMTRI, TDN, QPH), pp. 1204–1209.
VLDBVLDB-2012-AhmadKKN #higher-order #named
DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views (YA, OK, CK, MN), pp. 968–979.
VLDBVLDB-2012-KangLM #performance #throughput
Flash-based Extended Cache for Higher Throughput and Faster Recovery (WHK, SWL, BM), pp. 1615–1626.
SASSAS-2012-Ledesma-GarzaR #analysis #functional #higher-order #reachability #source code
Binary Reachability Analysis of Higher Order Functional Programs (RLG, AR), pp. 388–404.
SASSAS-2012-MadhavanRV #analysis #composition #higher-order #source code
Modular Heap Analysis for Higher-Order Programs (RM, GR, KV), pp. 370–387.
STOCSTOC-2012-LeeGT #clustering #higher-order #multi
Multi-way spectral partitioning and higher-order cheeger inequalities (JRL, SOG, LT), pp. 1117–1130.
STOCSTOC-2012-LouisRTV
Many sparse cuts via higher eigenvalues (AL, PR, PT, SV), pp. 1131–1140.
FLOPSFLOPS-2012-Terauchi #automation #functional #higher-order #source code #verification
Automated Verification of Higher-Order Functional Programs (TT), p. 2.
FLOPSFLOPS-2012-TobitaTK #analysis #higher-order #model checking
Exact Flow Analysis by Higher-Order Model Checking (YT, TT, NK), pp. 275–289.
ICFPICFP-2012-EarlSMH #analysis #automaton #higher-order #source code
Introspective pushdown analysis of higher-order programs (CE, IS, MM, DVH), pp. 177–188.
ICFPICFP-2012-LippmeierCKLJ #higher-order #performance
Work efficient higher-order vectorisation (BL, MMTC, GK, RL, SLPJ), pp. 259–270.
ICFPICFP-2012-MyreenO #higher-order #logic #ml #synthesis
Proof-producing synthesis of ML from higher-order logic (MOM, SO), pp. 115–126.
ICFPICFP-2012-NeatherwayRO #algorithm #higher-order #model checking
A traversal-based algorithm for higher-order model checking (RPN, SJR, CHLO), pp. 353–364.
ICPRICPR-2012-PitchayK #multi
Multi-task signal recovery by higher level hyper-parameter sharing (SAP, AK), pp. 2246–2249.
ICPRICPR-2012-RubioSLP #graph #higher-order #image #representation
Image contextual representation and matching through hierarchies and higher order graphs (JCR, JS, AML, NP), pp. 2664–2667.
SIGIRSIGIR-2012-BenderskyC #dependence #higher-order #information retrieval #modelling #query #using
Modeling higher-order term dependencies in information retrieval using query hypergraphs (MB, WBC), pp. 941–950.
OOPSLAOOPSLA-2012-Tobin-HochstadtH #contract #execution #higher-order #symbolic computation
Higher-order symbolic execution via contracts (STH, DVH), pp. 537–554.
POPLPOPL-2012-KrishnaswamiBH #bound #functional #higher-order #programming
Higher-order functional reactive programming in bounded space (NRK, NB, JH), pp. 45–58.
FSEFSE-2012-ParkHHCGTFX #named #performance
CarFast: achieving higher statement coverage faster (SP, BMMH, IH, CC, MG, KT, CF, QX), p. 35.
LDTALDTA-2012-LinckeS #concept #higher-order #object-oriented
From HOT to COOL: transforming higher-order typed languages to concept-constrained object-oriented languages (DL, SS), p. 3.
SLESLE-2012-KrishnanW #analysis #attribute grammar #higher-order #termination
Termination Analysis for Higher-Order Attribute Grammars (LK, EVW), pp. 44–63.
CAVCAV-2012-HopkinsMO #equivalence #higher-order #ml #named
Hector: An Equivalence Checker for a Higher-Order Fragment of ML (DH, ASM, CHLO), pp. 774–780.
CSLCSL-2012-Atkey #parametricity #relational
Relational Parametricity for Higher Kinds (RA), pp. 46–61.
CSLCSL-2012-BaillotL #complexity #higher-order
Higher-Order Interpretations and Program Complexity (PB, UDL), pp. 62–76.
IJCARIJCAR-2012-Brown #automation #higher-order #named #proving
Satallax: An Automatic Higher-Order Prover (CEB), pp. 111–117.
LICSLICS-2012-PierardS #calculus #distributed #higher-order
A Higher-Order Distributed Calculus with Name Creation (AP, ES), pp. 531–540.
LICSLICS-2012-TraytelPB #category theory #composition #data type #higher-order #logic #proving #theorem proving
Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving (DT, AP, JCB), pp. 596–605.
LICSLICS-2012-Vicary #protocol #quantum #semantics
Higher Semantics of Quantum Protocols (JV), pp. 606–615.
RTARTA-2012-FuhsK #higher-order #polynomial
Polynomial Interpretations for Higher-Order Rewriting (CF, CK), pp. 176–192.
VMCAIVMCAI-2012-CharltonHR #higher-order #named #source code #verification
Crowfoot: A Verifier for Higher-Order Store Programs (NC, BH, BR), pp. 136–151.
DATEDATE-2011-KimCSY #modelling #parallel #performance #simulation #using
Temporal parallel simulation: A fast gate-level HDL simulation using higher level models (DK, MJC, KS, SY), pp. 1584–1589.
VLDBVLDB-2011-VuB #evaluation #higher-order #named
HOMES: A Higher-Order Mapping Evaluation System (HV, MB), pp. 1399–1402.
CSEETCSEET-2011-ChookittikulMK #agile #education
Agile methods in Thai higher education and beyond (WC, PEM, JLK), p. 557.
CSEETCSEET-2011-SallehMG #education #experience #programming
The effects of openness to experience on pair programming in a higher education context (NS, EM, JCG), pp. 149–158.
ESOPESOP-2011-KoutavasH #encryption #higher-order #testing
A Testing Theory for a Higher-Order Cryptographic Language — (Extended Abstract) (VK, MH), pp. 358–377.
FoSSaCSFoSSaCS-2011-Kobayashi #algorithm #automaton #higher-order #linear #model checking #recursion
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (NK0), pp. 260–274.
FoSSaCSFoSSaCS-2011-PierardS #bisimulation #calculus #distributed #higher-order #process
Sound Bisimulations for Higher-Order Distributed Process Calculus (AP, ES), pp. 123–137.
SCAMSCAM-2011-NicolayRMJ #automation #higher-order #parallel #source code
Automatic Parallelization of Side-Effecting Higher-Order Scheme Programs (JN, CDR, WDM, VJ), pp. 185–194.
PLDIPLDI-2011-Godefroid #generative #higher-order #testing
Higher-order test generation (PG), pp. 258–269.
PLDIPLDI-2011-KobayashiSU #abstraction #higher-order #model checking
Predicate abstraction and CEGAR for higher-order model checking (NK, RS, HU), pp. 222–233.
SASSAS-2011-MightH #abstract interpretation #concurrent #higher-order #product line #source code #static analysis
A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs (MM, DVH), pp. 180–197.
ICALPICALP-v2-2011-SalvatiW #higher-order
Krivine Machines and Higher-Order Schemes (SS, IW), pp. 162–173.
ICFPICFP-2011-DisneyFM #contract #higher-order
Temporal higher-order contracts (TD, CF, JM), pp. 176–188.
HCIHCI-MIIE-2011-ForutanpourR #collaboration #mobile #named #using
ProJest: Enabling Higher Levels of Collaboration Using Today’s Mobile Devices (BF, JR), pp. 48–58.
HCIIDGD-2011-LeeY #education #web
Does Internationalization Have Its Own Face in Each Country? Measuring the Internationalization of Web Presence on Higher Education Admission Web Pages between USA and Taiwan (JL, MY), pp. 524–532.
HCIOCSC-2011-ConnollyM #education #network #social
Third Agers and Social Networking in Higher Education (CMC, GM), pp. 30–39.
HCIOCSC-2011-KadenbachK #community #education #online #research #roadmap
Recent Trends in Software Support for Online Communities for Teaching and Research Projects in Higher Education (DK, CK), pp. 50–59.
BXBX-2011-Schmitt #higher-order #π-calculus
Reversible Higher Order π Calculus (AS), p. 63.
PPDPPPDP-2011-VirsedaM #composition #constraints #declarative #higher-order #programming #semantics
A modular semantics for higher-order declarative programming with constraints (RdVV, FPM), pp. 41–52.
POPLPOPL-2011-OngR #algebra #data type #functional #higher-order #pattern matching #source code #verification
Verifying higher-order functional programs with pattern-matching algebraic data types (CHLO, SJR), pp. 587–598.
ESEC-FSEESEC-FSE-2011-HarmanJL #generative #higher-order #testing
Strong higher order mutation-based test data generation (MH, YJ, WBL), pp. 212–222.
LDTALDTA-2011-EconomopoulosF #higher-order #syntax
Higher-order transformations with nested concrete syntax (GRE, BF), p. 4.
CADECADE-2011-Brown #higher-order #problem #proving #satisfiability #sequence #theorem proving
Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems (CEB), pp. 147–161.
LICSLICS-2011-BarrasJSW #decidability #first-order #higher-order #named #type system
CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory (BB, JPJ, PYS, QW), pp. 143–151.
LICSLICS-2011-Clairambault #higher-order #morphism
Isomorphisms of Types in the Presence of Higher-Order References (PC), pp. 152–161.
LICSLICS-2011-HasuoH #geometry #higher-order #interactive #quantum #semantics
Semantics of Higher-Order Quantum Computation via Geometry of Interaction (IH, NH), pp. 237–246.
LICSLICS-2011-Kobayashi #higher-order #model checking #theory and practice
Higher-Order Model Checking: From Theory to Practice (NK0), pp. 219–224.
RTARTA-2011-AotoYC #higher-order #induction #theorem
Natural Inductive Theorems for Higher-Order Rewriting (TA, TY, YC), pp. 107–121.
RTARTA-2011-KopR #algebra #dependence #functional #higher-order
Higher Order Dependency Pairs for Algebraic Functional Systems (CK, FvR), pp. 203–218.
RTARTA-2011-Roux #dependence #higher-order #refinement
Refinement Types as Higher-Order Dependency Pairs (CR), pp. 299–312.
TLCATLCA-2011-AbelP #dependent type #higher-order #unification
Higher-Order Dynamic Pattern Unification for Dependent Types and Records (AA, BP), pp. 10–26.
PODSPODS-2010-BenediktPV #higher-order #query
Positive higher-order queries (MB, GP, HV), pp. 27–38.
SIGMODSIGMOD-2010-ChenGN #named #statistics
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees (SC, PBG, SN), pp. 147–158.
ITiCSEITiCSE-2010-CoconF #education #learning #named #online
LOMOLEHEA: learning object model for online learning based on the european higher education area (FC, EF), pp. 78–82.
ITiCSEITiCSE-2010-Cox #development #education #usability
Usability, engagement & development of a digital usability laboratory in a higher education environment (DC), pp. 269–273.
FoSSaCSFoSSaCS-2010-Stirling #decidability #higher-order
Introduction to Decidability of Higher-Order Matching (CS), p. 1.
PEPMPEPM-2010-Haftmann #haskell #higher-order #logic
From higher-order logic to Haskell: there and back again (FH), pp. 155–158.
FLOPSFLOPS-2010-HaftmannN #code generation #higher-order #term rewriting
Code Generation via Higher-Order Rewrite Systems (FH, TN), pp. 103–117.
ICALPICALP-v2-2010-LanesePSS #calculus #communication #higher-order #on the #process
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 442–453.
ICFPICFP-2010-Crary #higher-order #logic #representation
Higher-order representation of substructural logics (KC), pp. 131–142.
ICFPICFP-2010-DreyerNB #higher-order #reasoning #relational
The impact of higher-order state and control effects on local relational reasoning (DD, GN, LB), pp. 143–156.
ICFPICFP-2010-HoldermansH #analysis #higher-order #polymorphism
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators (SH, JH), pp. 63–74.
ICEISICEIS-DISI-2010-MarksR #education
Chief Information Officer Profile in Higher Education (AM, YR), pp. 159–165.
ICEISICEIS-DISI-2010-ZhangOCK #case study #data mining #education #mining #student
Use Data Mining to Improve Student Retention in Higher Education — A Case Study (YZ, SO, TC, HK), pp. 190–197.
ICPRICPR-2010-SemenovichS #higher-order #performance
Tensor Power Method for Efficient MAP Inference in Higher-order MRFs (DS, AS), pp. 734–737.
KEODKEOD-2010-ChanLB #automation #evolution #higher-order #ontology #reasoning #representation
Higher-order Representation and Reasoning for Automated Ontology Evolution (MC, JL, AB), pp. 84–93.
ICMTICMT-2010-TisiCJ #atl #higher-order
Improving Higher-Order Transformations Support in ATL (MT, JC, FJ), pp. 215–229.
OOPSLAOOPSLA-2010-KleinFF #higher-order #random testing #source code #testing
Random testing for higher-order, stateful programs (CK, MF, RBF), pp. 555–566.
PPDPPPDP-2010-Gacek #higher-order #specification #syntax
Relating nominal and higher-order abstract syntax specifications (AG), pp. 177–186.
POPLPOPL-2010-DreyerNRB #data type #higher-order #logic #relational
A relational modal logic for higher-order stateful ADTs (DD, GN, AR, LB), pp. 185–198.
POPLPOPL-2010-JostHLH #higher-order #resource management #source code
Static determination of quantitative resource usage for higher-order programs (SJ, KH, HWL, MH), pp. 223–236.
POPLPOPL-2010-KobayashiTU #higher-order #multi #recursion #transducer #verification
Higher-order multi-parameter tree transducers and recursion schemes for program verification (NK, NT, HU), pp. 495–508.
SACSAC-2010-ZhouS #ad hoc #energy #network #performance #throughput #towards
Towards higher throughput and energy efficiency in dense wireless ad hoc and sensor networks (WZ, RS), pp. 749–755.
ICLPICLP-2010-Pahlavi10 #higher-order #learning #logic
Higher-order Logic Learning and λ-Progol (NP), pp. 281–285.
IJCARIJCAR-2010-BackesB #higher-order #logic
Analytic Tableaux for Higher-Order Logic with Choice (JB, CEB), pp. 76–90.
IJCARIJCAR-2010-BlanchetteK #higher-order
Monotonicity Inference for Higher-Order Formulas (JCB, AK), pp. 91–106.
RTARTA-2010-AppelOS #composition #higher-order
Higher-Order (Non-)Modularity (CA, VvO, JGS), pp. 17–32.
DACDAC-2009-YooYC #design #memory management #multi #performance
Multiprocessor System-on-Chip designs with active memory processors for higher memory efficiency (JhY, SY, KC), pp. 806–811.
DATEDATE-2009-ZiermannWT #network #protocol
CAN+: A new backward-compatible Controller Area Network (CAN) protocol with up to 16× higher data rates (TZ, SW, JT), pp. 1088–1093.
CSEETCSEET-2009-WuWSK #development #education #evaluation #framework #game studies #using
An Evaluation of Using a Game Development Framework in Higher Education (BW, AIW, JES, TBK), pp. 41–44.
ESOPESOP-2009-LakinP #functional #higher-order #induction #programming
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming (MRL, AMP), pp. 47–61.
ESOPESOP-2009-SiekGT #design #higher-order
Exploring the Design Space of Higher-Order Casts (JGS, RG, WT), pp. 17–31.
FoSSaCSFoSSaCS-2009-BroadbentO #higher-order #model checking #on the #recursion
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (CHB, CHLO), pp. 107–121.
PEPMPEPM-2009-PardoFS #higher-order #monad #source code
Shortcut fusion rules for the derivation of circular and higher-order monadic programs (AP, JPF, JS), pp. 81–90.
ICFPICFP-2009-ChlipalaMMSW #effectiveness #higher-order #imperative #interactive #proving #source code
Effective interactive proofs for higher-order imperative programs (AC, JGM, GM, AS, RW), pp. 79–90.
HCIOCSC-2009-KadenbachK #challenge #collaboration #development #education #social #using
Benefits and Challenges of Using Collaborative Development Environments with Social Software in Higher Computer Science Education (DK, CK), pp. 479–487.
HCIOCSC-2009-PuseyM #education #heuristic #implementation #learning #wiki
Heuristics for Implementation of Wiki Technology in Higher Education Learning (PP, GM), pp. 507–514.
ICMLICML-2009-QianJZHW #higher-order #random #sequence
Sparse higher order conditional random fields for improved sequence labeling (XQ, XJ, QZ, XH, LW), pp. 849–856.
KDIRKDIR-2009-PiedadeS #education #student
Business Intelligence in Higher Education — Managing the Relationships with Students (MBP, MYS), pp. 297–302.
ECMFAECMDA-FA-2009-TisiJFCB #higher-order #model transformation #on the
On the Use of Higher-Order Model Transformations (MT, FJ, PF, SC, JB), pp. 18–33.
PPDPPPDP-2009-BentonKBH #higher-order #program transformation #relational #semantics
Relational semantics for effect-based program transformations: higher-order store (NB, AK, LB, MH), pp. 301–312.
PPDPPPDP-2009-Kobayashi #higher-order #model checking
Model-checking higher-order functions (NK), pp. 25–36.
PPDPPPDP-2009-Virseda #algorithm #debugging #declarative #framework #higher-order #logic #source code #verification
A higher-order logical framework for the algorithmic debugging and verification of declarative programs (RdVV), pp. 49–60.
POPLPOPL-2009-JonssonN #call-by #higher-order #supercompilation
Positive supercompilation for a higher order call-by-value language (PAJ, JN), pp. 277–288.
POPLPOPL-2009-Kobayashi #higher-order #recursion #source code #verification
Types and higher-order recursion schemes for verification of higher-order programs (NK), pp. 416–428.
CADECADE-2009-SutcliffeBBT #automation #development #higher-order #logic #proving #theorem proving
Progress in the Development of Automated Theorem Proving for Higher-Order Logic (GS, CB, CEB, FT), pp. 116–130.
CAVCAV-2009-HopkinsO #equivalence #higher-order #model checking #named
Homer: A Higher-Order Observational Equivalence Model checkER (DH, CHLO), pp. 654–660.
CSLCSL-2009-SchwinghammerBRY #higher-order #hoare
Nested Hoare Triples and Frame Rules for Higher-Order Store (JS, LB, BR, HY), pp. 440–454.
LICSLICS-2009-KobayashiO #calculus #higher-order #model checking #recursion #type system #μ-calculus
A Type System Equivalent to the Modal μ-Calculus Model Checking of Higher-Order Recursion Schemes (NK, CHLO), pp. 179–188.
TLCATLCA-2009-MostrousY #communication #higher-order #mobile #optimisation #process
Session-Based Communication Optimisation for Higher-Order Mobile Processes (DM, NY), pp. 203–218.
VMCAIVMCAI-2009-DimoulasW #higher-order #problem
The Higher-Order Aggregate Update Problem (CD, MW), pp. 44–58.
DocEngDocEng-2008-IorioFVLW #abstraction #layout
Higher-level layout through topological abstraction (ADI, LF, FV, JWL, TW), pp. 90–99.
ITiCSEITiCSE-2008-Sheridan-RossGF #education
Practical tips for creating podcasts in higher education (JSR, AG, JF), p. 311.
ESOPESOP-2008-Ong #approach #higher-order #semantics #verification
Verification of Higher-Order Computation: A Game-Semantic Approach (CHLO), pp. 299–306.
ESOPESOP-2008-PoswolskyS #dependent type #encoding #higher-order #programming
Practical Programming with Higher-Order Encodings and Dependent Types (AP, CS), pp. 93–107.
SCAMSCAM-2008-JiaH #fault #higher-order #mutation testing #testing #using
Constructing Subtle Faults Using Higher Order Mutation Testing (YJ, MH), pp. 249–258.
WCREWCRE-2008-Muliawan #higher-order #model transformation #using
Extending a Model Transformation Language Using Higher Order Transformations (OM), pp. 315–318.
ICALPICALP-B-2008-BirkedalRSY #higher-order #logic
A Simple Model of Separation Logic for Higher-Order Store (LB, BR, JS, HY), pp. 348–360.
ICFPICFP-2008-Chlipala #higher-order #parametricity #semantics #syntax
Parametric higher-order abstract syntax for mechanized semantics (AC), pp. 143–156.
CIKMCIKM-2008-AzzopardiV #evaluation #higher-order #information management #named
Retrievability: an evaluation measure for higher order information access tasks (LA, VV), pp. 561–570.
ICPRICPR-2008-ChenCW #higher-order #named #performance #using
HOPS: Efficient region labeling using Higher Order Proxy Neighborhoods (AYCC, JJC, LW), pp. 1–4.
ICPRICPR-2008-ParamanandR #geometry #higher-order #performance
Efficient geometric matching with higher-order features (CP, ANR), pp. 1–4.
SIGIRSIGIR-2008-KeskustaloJPK #higher-order #performance #visualisation
Intuition-supporting visualization of user’s performance based on explicit negative higher-order relevance (HK, KJ, AP, JK), pp. 675–682.
OOPSLAOOPSLA-2008-MoorsPO
Generics of a higher kind (AM, FP, MO), pp. 423–438.
LOPSTRLOPSTR-2008-ArroyoRTV #approach #functional #higher-order #source code
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs (GA, JGR, ST, GV), pp. 40–54.
PPDPPPDP-2008-ChitilD #algorithm #debugging #finite #functional #higher-order #source code
Comprehending finite maps for algorithmic debugging of higher-order functional programs (OC, TD), pp. 205–216.
POPLPOPL-2008-Pientka #higher-order #programming #syntax
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions (BP), pp. 371–382.
POPLPOPL-2008-Zeilberger #higher-order #syntax
Focusing and higher-order abstract syntax (NZ), pp. 359–369.
SACSAC-2008-LevadaMTS #estimation #higher-order #parametricity #pseudo
Spatially non-homogeneous potts model parameter estimation on higher-order neighborhood systems by maximum pseudo-likelihood (ALML, NDAM, AT, DHPS), pp. 1733–1737.
SLESLE-2008-GorpKJ #higher-order #integration #model transformation
Transformation Language Integration Based on Profiles and Higher Order Transformations (PVG, AK, DJ), pp. 208–226.
LCTESLCTES-2008-DelavalGP #automation #data flow #higher-order #source code #type system
A type system for the automatic distribution of higher-order synchronous dataflow programs (GD, AG, MP), pp. 101–110.
CSLCSL-2008-AbelR #higher-order #type system
Syntactic Metatheory of Higher-Order Subtyping (AA, DR), pp. 446–460.
IJCARIJCAR-2008-BenzmullerPTF #automation #higher-order #logic #named #proving #theorem proving
LEO-II — A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) (CB, LCP, FT, AF), pp. 162–170.
IJCARIJCAR-2008-BenzmullerRS #higher-order #logic #named
THF0 — The Core of the TPTP Language for Higher-Order Logic (CB, FR, GS), pp. 491–506.
LICSLICS-2008-CarayolHMOS #automaton #game studies #higher-order
Winning Regions of Higher-Order Pushdown Games (AC, MH, AM, CHLO, OS), pp. 193–204.
LICSLICS-2008-LanesePSS #calculus #decidability #higher-order #on the #process
On the Expressiveness and Decidability of Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 145–155.
LICSLICS-2008-Pottier #anti #higher-order
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule (FP), pp. 331–340.
RTARTA-2008-ArrighiD #algebra #confluence #encoding #higher-order #λ-calculus
Linear-algebraic λ-calculus: higher-order, encodings, and confluence (PA, GD), pp. 17–31.
RTARTA-2008-LevyV #higher-order #perspective #unification
Nominal Unification from a Higher-Order Perspective (JL, MV), pp. 246–260.
TAPTAP-2008-Cao #equivalence #finite #higher-order #π-calculus
Equivalence Checking for a Finite Higher Order π-Calculus (ZC), pp. 30–47.
ESOPESOP-2007-LiOS #compilation #higher-order #logic #set
Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic (GL, SO, KS), pp. 205–219.
ESOPESOP-2007-Pitts #equivalence #higher-order
Techniques for Contextual Equivalence in Higher-Order, Typed Languages (AMP), p. 1.
FoSSaCSFoSSaCS-2007-HagueO #analysis #automaton #higher-order
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems (MH, CHLO), pp. 213–227.
FoSSaCSFoSSaCS-2007-YoshidaHB #higher-order #logic #reasoning
Logical Reasoning for Higher-Order Functions with Local State (NY, KH, MB), pp. 361–377.
ICFPICFP-2007-Park #higher-order #type safety
Type-safe higher-order channels in ML-like languages (SP), pp. 191–202.
ICFPICFP-2007-Sereni #analysis #functional #graph #higher-order #source code #termination
Termination analysis and call graph construction for higher-order functional programs (DS), pp. 71–84.
ECOOPECOOP-2007-DoorenS #abstraction #inheritance #using
A Higher Abstraction Level Using First-Class Inheritance Relations (MvD, ES), pp. 425–449.
OOPSLAOOPSLA-2007-ShanerLN #composition #higher-order #source code #verification
Modular verification of higher-order methods with mandatory calls specified by model programs (SMS, GTL, DAN), pp. 351–368.
PPDPPPDP-2007-Hamana #data type #higher-order #induction #semantics #type system
Higher-order semantic labelling for inductive datatype systems (MH), pp. 97–108.
PADLPADL-2007-Liang #aspect-oriented #higher-order #linear #logic #programming
Aspect-Oriented Programming in Higher-Order and Linear Logic (CCL), pp. 305–319.
POPLPOPL-2007-Might #analysis #higher-order #source code
Logic-flow analysis of higher-order programs (MM), pp. 185–198.
POPLPOPL-2007-PearlmutterS #higher-order #lazy evaluation #multi
Lazy multivariate higher-order forward-mode AD (BAP, JMS), pp. 155–160.
SPLCSPLC-2007-JanotaK #feature model #higher-order #logic #modelling #reasoning
Reasoning about Feature Models in Higher-Order Logic (MJ, JRK), pp. 13–22.
SPLCSPLC-2007-OldevikH #higher-order #product line
Higher-Order Transformations for Product Lines (JO, ØH), pp. 243–254.
CADECADE-2007-LiS #compilation #higher-order #logic
Compilation as Rewriting in Higher Order Logic (GL, KS), pp. 19–34.
LICSLICS-2007-SangiorgiKS #bisimulation #higher-order
Environmental Bisimulations for Higher-Order Languages (DS, NK, ES), pp. 293–302.
LICSLICS-2007-Stirling #automaton #game studies #higher-order
Higher-Order Matching, Games and Automata (CS), pp. 326–335.
TLCATLCA-2007-LiptonN #constraints #higher-order #logic programming #programming language #semantics
Higher-Order Logic Programming Languages with Constraints: A Semantics (JL, SN), pp. 272–289.
TLCATLCA-2007-MostrousY #higher-order #mobile #process #type system
Two Session Typing Systems for Higher-Order Mobile Processes (DM, NY), pp. 321–335.
DATEDATE-2006-PanditKMP #hardware #higher-order #synthesis
High level synthesis of higher order continuous time state variable filters with minimum sensitivity and hardware count (SP, SK, CAM, AP), pp. 1203–1204.
FoSSaCSFoSSaCS-2006-Cao #bisimulation #higher-order #π-calculus
More on Bisimulations for Higher Order π-Calculus (ZC), pp. 63–78.
TACASTACAS-2006-GhicaM #composition #concurrent #higher-order #source code
Compositional Model Extraction for Higher-Order Concurrent Programs (DRG, ASM), pp. 303–317.
CSMRCSMR-2006-Rysselberghe #version control
Reconstructing Higher Level Change Information from Versioning Data (FVR), pp. 331–333.
PEPMPEPM-2006-WangCK #aspect-oriented #functional #higher-order #weaving
Type-directed weaving of aspects for higher-order functional languages (MW, KC, SCK), pp. 78–87.
FLOPSFLOPS-2006-CasasCH #approach #evaluation #functional #higher-order #lazy evaluation
A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems (AC, DC, MVH), pp. 146–162.
ICALPICALP-v2-2006-HondaBY #higher-order #logic
Descriptive and Relative Completeness of Logics for Higher-Order Functions (KH, MB, NY), pp. 360–371.
ICALPICALP-v2-2006-Stirling #approach #game studies #higher-order
A Game-Theoretic Approach to Deciding Higher-Order Matching (CS), pp. 348–359.
ICFPICFP-2006-VytiniotisWJ #rank
Boxy types: inference for higher-rank types and impredicativity (DV, SW, SLPJ), pp. 251–262.
ICMLICML-2006-AgarwalBB #graph #higher-order #learning
Higher order learning with graphs (SA, KB, SB), pp. 17–24.
ICPRICPR-v2-2006-HorvathJZK #detection #higher-order
A Higher-Order Active Contour Model for Tree Detection (PH, IJ, JZ, ZK), pp. 130–133.
ICPRICPR-v2-2006-TakiguchiOM #case study #comprehension #fault #recognition
A Study on Character Recognition Error Correction at Higher Level Recognition Step for Mathematical Formulae Understanding (YT, MO, YM), pp. 966–969.
POPLPOPL-2006-KoutavasW #bisimulation #higher-order #imperative #reasoning #source code
Small bisimulations for reasoning about higher-order imperative programs (VK, MW), pp. 141–152.
CSLCSL-2006-HellaT #higher-order #logic #problem
Complete Problems for Higher Order Logics (LH, JMTT), pp. 380–394.
CSLCSL-2006-ReusS #higher-order #logic
Separation Logic for Higher-Order Store (BR, JS), pp. 575–590.
IJCARIJCAR-2006-GelderS #automation #generative #higher-order #logic #parsing
Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation (AVG, GS), pp. 156–161.
IJCARIJCAR-2006-Krauss #higher-order #logic #recursion
Partial Recursive Functions in Higher-Order Logic (AK), pp. 589–603.
IJCARIJCAR-2006-Pientka #approach #higher-order #lightweight #unification
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach (BP), pp. 362–376.
LICSLICS-2006-Ong #higher-order #model checking #on the #recursion
On Model-Checking Trees Generated by Higher-Order Recursion Schemes (CHLO), pp. 81–90.
RTARTA-2006-Bruggink #finite #higher-order #product line #proving #using
A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property (HJSB), pp. 372–386.
RTARTA-2006-JouannaudR #higher-order
Higher-Order Orderings for Normal Rewriting (JPJ, AR), pp. 387–399.
RTARTA-2006-Koprowski #higher-order #recursion
Certified Higher-Order Recursive Path Ordering (AK), pp. 227–241.
RTARTA-2006-Obua #higher-order #logic
Checking Conservativity of Overloaded Definitions in Higher-Order Logic (SO), pp. 212–226.
DATEDATE-2005-BhaduriV #higher-order #induction #metric
Inductive and Capacitive Coupling Aware Routing Methodology Driven by a Higher Order RLCK Moment Metric (AB, RV), pp. 922–923.
HTHT-2005-HorieYK #analysis #higher-order #rank #web
Higher-order rank analysis for web structure (IH, KY, KK), pp. 98–106.
ESOPESOP-2005-BieringBT #higher-order #logic
BI Hyperdoctrines and Higher-Order Separation Logic (BB, LB, NTS), pp. 233–247.
FoSSaCSFoSSaCS-2005-Fahrenberg #automaton
A Category of Higher-Dimensional Automata (UF), pp. 187–201.
WCREWCRE-2005-SpoonS #higher-order #navigation #scalability #semantics
Semantic Navigation of Large Code Bases in Higher-Order, Dynamically Typed Languages (SAS, OS), pp. 219–228.
PLDIPLDI-2005-KrishnaswamiA #encapsulation #higher-order
Permission-based ownership: encapsulating state in higher-order typed languages (NRK, JA), pp. 96–106.
ICALPICALP-2005-ReusS #higher-order #hoare #logic
About Hoare Logics for Higher-Order Store (BR, TS), pp. 1337–1348.
ICFPICFP-2005-BergerHY #alias #analysis #higher-order #imperative #logic
A logical analysis of aliasing in imperative higher-order functions (MB, KH, NY), pp. 280–293.
ESEC-FSEESEC-FSE-2005-BasitJ #detection #similarity #source code
Detecting higher-level similarity patterns in programs (HAB, SJ), pp. 156–165.
CADECADE-2005-Pientka #higher-order #logic programming
Tabling for Higher-Order Logic Programming (BP), pp. 54–68.
CSLCSL-2005-Stirling #game studies #higher-order
Higher-Order Matching and Games (CS), pp. 119–134.
ICLPICLP-2005-NadathurL #higher-order #on the fly #unification
Practical Higher-Order Pattern Unification with On-the-Fly Raising (GN, NL), pp. 371–386.
LICSLICS-2005-BirkedalTY #higher-order #semantics #type system
Semantics of Separation-Logic Typing and Higher-Order Frame Rules (LB, NTS, HY), pp. 260–269.
LICSLICS-2005-HondaYB #higher-order #imperative #logic
An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules (KH, NY, MB), pp. 270–279.
LICSLICS-2005-Lago #geometry #higher-order #linear #recursion
The Geometry of Linear Higher-Order Recursion (UDL), pp. 366–375.
RTARTA-2005-Hamana #algebra #higher-order #termination
Universal Algebra for Termination of Higher-Order Rewriting (MH), pp. 135–149.
RTARTA-2005-Yoshinaka #higher-order #linear #λ-calculus
Higher-Order Matching in the Linear λ Calculus in the Absence of Constants Is NP-Complete (RY), pp. 235–249.
TLCATLCA-2005-BoveC #higher-order #recursion
Recursive Functions with Higher Order Domains (AB, VC), pp. 116–130.
TLCATLCA-2005-SchurmannPS #calculus #encoding #functional #higher-order #programming
The [triangle]-Calculus. Functional Programming with Higher-Order Encodings (CS, AP, JS), pp. 339–353.
TLCATLCA-2005-Zanardini #higher-order
Higher-Order Abstract Non-interference (DZ), pp. 417–432.
ICFPICFP-2004-MarlowJ #higher-order #performance
Making a fast curry: push/enter vs. eval/apply for higher-order languages (SM, SLPJ), pp. 4–15.
ICEISICEIS-v2-2004-DykC #education #mining #process #statistics
Warehousing and Mining of Higher Education Data by Means of Statistical Process Control (LVD, PC), pp. 110–115.
ICPRICPR-v2-2004-LindeL #higher-order #recognition #using
Object Recognition Using Composed Receptive Field Histograms of Higher Dimensionality (OL, TL), pp. 1–6.
ICPRICPR-v4-2004-KobayashiO #higher-order #identification #multi #polynomial #using
Action and Simultaneous Multiple-Person Identification Using Cubic Higher-Order Local Auto-Correlation (TK, NO), pp. 741–744.
PPDPPPDP-2004-HondaY #composition #higher-order #logic #polymorphism
A compositional logic for polymorphic higher-order functions (KH, NY), pp. 191–202.
POPLPOPL-2004-Yoshida #dependent type #higher-order #mobile #process
Channel dependent types for higher-order mobile processes (NY), pp. 147–160.
SACSAC-2004-BettiniBL #calculus #higher-order #mixin
A core calculus of higher-order mixins and classes (LB, VB, SL), pp. 1508–1509.
CSLCSL-2004-GrooteS #higher-order #linear #λ-calculus
Higher-Order Matching in the Linear λ-calculus with Pairing (PdG, SS), pp. 220–234.
RTARTA-2004-AotoYT #higher-order #induction #theorem
Inductive Theorems for Higher-Order Rewriting (TA, TY, YT), pp. 269–284.
RTARTA-2004-Blanqui #higher-order #term rewriting #termination #type system
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems (FB), pp. 24–39.
RTARTA-2004-Toyama #higher-order #lisp #term rewriting #termination
Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms (YT), pp. 40–54.
ESOPESOP-2003-HaackW #fault #higher-order #slicing
Type Error Slicing in Implicitly Typed Higher-Order Languages (CH, JBW), pp. 284–301.
FoSSaCSFoSSaCS-2003-AbelMU #data type #higher-order
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes (AA, RM, TU), pp. 54–69.
FoSSaCSFoSSaCS-2003-Bonelli #calculus #higher-order #normalisation
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions (EB), pp. 153–168.
FoSSaCSFoSSaCS-2003-MomiglianoA #higher-order #multi #syntax
Multi-level Meta-reasoning with Higher-Order Abstract Syntax (AM, SA), pp. 375–391.
STOCSTOC-2003-AronovPST
Distinct distances in three and higher dimensions (BA, JP, MS, GT), pp. 541–546.
STOCSTOC-2003-CoppersmithS #higher-order #semistructured data
Reconstructing curves in three (and higher) dimensional space from noisy data (DC, MS), pp. 136–142.
ICALPICALP-2003-Cachat #automaton #game studies #graph #higher-order
Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games (TC), pp. 556–569.
ICALPICALP-2003-Hannay #axiom #data type #higher-order
Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types (JEH), pp. 903–917.
ICFPICFP-2003-WashburnW #encoding #higher-order #morphism #parametricity #polymorphism #syntax
Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism (GW, SW), pp. 249–262.
IFLIFL-2003-VasconcelosH #equation #functional #higher-order #polymorphism #recursion #source code
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs (PBV, KH), pp. 86–101.
ECOOPECOOP-2003-Ernst #higher-order
Higher-Order Hierarchies (EE), pp. 303–328.
LOPSTRLOPSTR-2003-YokoyamaHT #higher-order #program transformation
Deterministic Higher-Order Patterns for Program Transformation (TY, ZH, MT), pp. 128–142.
POPLPOPL-2003-DreyerCH #higher-order #type system
A type system for higher-order modules (DD, KC, RH), pp. 236–249.
POPLPOPL-2003-SchmittS #calculus #distributed #higher-order #process
The m-calculus: a higher-order distributed process calculus (AS, JBS), pp. 50–61.
RERE-2003-Catrava #quality #requirements #testing #towards #verification
Testing with Partial Traced Requirements: A Necessary Step Towards Higher Quality System Level Verification (SC), p. 303.
CADECADE-2003-MehtaN #higher-order #logic #pointer #proving #source code
Proving Pointer Programs in Higher-Order Logic (FM, TN), pp. 121–135.
CADECADE-2003-PientkaP #higher-order #optimisation #unification
Optimizing Higher-Order Pattern Unification (BP, FP), pp. 473–487.
CADECADE-2003-Schmidt-Schauss #bound #decidability #higher-order
Decidability of Arity-Bounded Higher-Order Matching (MSS), pp. 488–502.
ICLPICLP-2003-Pientka #higher-order
Higher-Order Substitution Tree Indexing (BP), pp. 377–391.
RTARTA-2003-Bruggink #higher-order
Residuals in Higher-Order Rewriting (HJSB), pp. 123–137.
RTARTA-2003-SalvatiG #complexity #higher-order #linear #on the #λ-calculus
On the Complexity of Higher-Order Matching in the Linear λ-Calculus (SS, PdG), pp. 234–245.
TLCATLCA-2003-Power #higher-order
A Universal Embedding for the Higher Order Structure of Computational Effects (JP), pp. 301–315.
ESOPESOP-2002-Weirich #analysis #higher-order
Higher-Order Intensional Type Analysis (SW), pp. 98–114.
FoSSaCSFoSSaCS-2002-KnapikNU #automaton #higher-order
Higher-Order Pushdown Trees Are Easy (TK, DN, PU), pp. 205–222.
PEPMPEPM-2002-GomezL #analysis #automation #bound #higher-order
Automatic time-bound analysis for a higher-order language (GG, YAL), pp. 75–86.
FLOPSFLOPS-2002-KasuyaSA #higher-order #normalisation #term rewriting
Descendants and Head Normalization of Higher-Order Rewrite Systems (HK, MS, KA), pp. 198–211.
ICFPICFP-2002-FindlerF #contract #higher-order
Contracts for higher-order functions (RBF, MF), pp. 48–59.
ICFPICFP-2002-NeubauerT #higher-order #morphism #polymorphism
Type classes with more higher-order polymorphism (MN, PT), pp. 179–190.
KRKR-2002-Gardenfors #concept #higher-order #induction #similarity
The Role of Higher Order Similarity in Induction and Concept Formation (PG), p. 629.
SIGIRSIGIR-2002-Kwok #precise #query
Higher precision for two-word queries (KLK), pp. 395–396.
GPCEGPCE-2002-Saraiva #attribute grammar #component #higher-order #programming
Component-Based Programming for Higher-Order Attribute Grammars (JS), pp. 268–282.
LOPSTRLOPSTR-2002-ColvinHHS #higher-order #logic programming #refinement #source code
Refinement of Higher-Order Logic Programs (RC, IJH, DH, PAS), pp. 126–143.
PPDPPPDP-2002-OstrovskyPT #calculus #higher-order #towards
Towards a primitive higher order calculus of broadcasting systems (KO, KVSP, WT), pp. 2–13.
PADLPADL-2002-Liang #compilation #higher-order #logic programming
Compiler Construction in Higher Order Logic Programming (CL), pp. 47–63.
CADECADE-2002-Brown #higher-order #proving #set #theorem proving
Solving for Set Variables in Higher-Order Theorem Proving (CEB), pp. 408–422.
CSLCSL-2002-Goubault-Larrecq #constraints #higher-order #set
Higher-Order Positive Set Constraints (JGL), pp. 473–489.
CSLCSL-2002-Leivant #complexity
Implicit Computational Complexity for Higher Type Functionals (DL), pp. 367–381.
CSLCSL-2002-Schmidt-SchaussS #bound #decidability #higher-order #unification
Decidability of Bounded Higher-Order Unification (MSS, KUS), pp. 522–536.
ICLPICLP-2002-Pientka #higher-order #logic programming
A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming (BP), pp. 271–286.
RTARTA-2002-DoughertyW #decidability #higher-order
A Decidable Variant of Higher Order Matching (DJD, TW), pp. 340–351.
VMCAIVMCAI-2002-CoppoD #higher-order #mobile
A Fully Abstract Model for Higher-Order Mobile Ambients (MC, MDC), pp. 255–271.
ASEASE-2001-CookIM #higher-order #proving #synthesis #theorem proving
Higher Order Function Synthesis Through Proof Planning (AC, AI, GM), pp. 307–310.
FoSSaCSFoSSaCS-2001-RocklHB #formal method #higher-order #induction #syntax #π-calculus
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts (CR, DH, SB), pp. 364–378.
STOCSTOC-2001-ChazelleL #bound
Lower bounds for intersection searching and fractional cascading in higher dimension (BC, DL), pp. 322–329.
FLOPSFLOPS-2001-DanvyN #higher-order
A Higher-Order Colon Translation (OD, LRN), pp. 78–91.
FLOPSFLOPS-2001-LeachN #constraints #higher-order #logic programming #programming language
A Higher-Order Logic Programming Language with Constraints (JL, SN), pp. 108–122.
CSLCSL-2001-Bezem #higher-order #logic programming #source code
An Improved Extensionality Criterion for Higher-Order Logic Programs (MB), pp. 203–216.
CSLCSL-2001-Schurmann #encoding #higher-order #recursion
Recursion for Higher-Order Encodings (CS), pp. 585–599.
ICLPICLP-2001-CodishGSS #analysis
Higher-Precision Groundness Analysis (MC, SG, HS, PJS), pp. 135–149.
IJCARIJCAR-2001-Pientka #higher-order #logic programming #reduction #source code #termination
Termination and Reduction Checking for Higher-Order Logic Programs (BP), pp. 401–415.
RTARTA-2001-BonelliKR #first-order #higher-order
From Higher-Order to First-Order Rewriting (EB, DK, AR), pp. 47–62.
RTARTA-2001-Raamsdonk #higher-order #on the #termination
On Termination of Higher-Order Rewriting (FvR), pp. 261–275.
FoSSaCSFoSSaCS-2000-Hannay #higher-order #simulation #system f
A Higher-Order Simulation Relation for System F (JEH), pp. 130–145.
STOCSTOC-2000-HarnikR #bound
Higher lower bounds on monotone size (DH, RR), pp. 378–387.
ICPRICPR-v4-2000-BarataPG #image
Segmenting at Higher Scales to Classify at Lower Scales. A Mathematical Morphology Based Methodology Applied to Forest Cover Remote Sensing Images (TB, PP, IG), pp. 4084–4087.
LOPSTRLOPSTR-2000-SeresS #higher-order #logic programming #source code
Higher-order transformation of logic programs (SS, JMS).
LOPSTRLOPSTR-2000-VanhoofB #analysis #composition #higher-order #towards
Towards a modular binding-time analysis for higher-order Mercury (WV, MB).
LOPSTRLOPSTR-J-2000-SeresS #higher-order #logic programming #source code
Higher-Order Transformation of Logic Programs (SS, JMS), pp. 57–68.
ICSEICSE-2000-Jalote #tutorial
Moving from ISO9000 to higher levels of the CMM (tutorial session) (PJ), p. 823.
OSDIOSDI-2000-LumbSGNR #towards
Towards Higher Disk Head Utilization: Extracting “Free” Bandwidth from Busy Disk Drives (CRL, JS, GRG, DN, ER), pp. 87–102.
CADECADE-2000-AndrewsB #education #higher-order #logic #named #proving #theorem proving #tutorial #using
Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic (PBA, CEB), pp. 511–512.
CADECADE-2000-MichaelA #bytecode #higher-order #logic #semantics #syntax
Machine Instruction Syntax and Semantics in Higher Order Logic (NGM, AWA), pp. 7–24.
ICLPCL-2000-Fitting #database
Databases and Higher Types (MF), pp. 41–52.
ICLPCL-2000-LaceyRS #higher-order #logic programming #synthesis
Logic Program Synthesis in a Higher-Order Setting (DL, JR, AS), pp. 87–100.
CSLCSL-2000-Naijun #calculus #higher-order
Completeness of Higher-Order Duration Calculus (ZN), pp. 442–456.
RTARTA-2000-Blanqui #confluence #higher-order #term rewriting #termination
Termination and Confluence of Higher-Order Rewrite Systems (FB), pp. 47–61.
RTARTA-2000-BonelliKR #higher-order
A de Bruijn Notation for Higher-Order Rewriting (EB, DK, AR), pp. 62–79.
RTARTA-2000-Groote #higher-order #linear
Linear Higher-Order Matching Is NP-Complete (PdG), pp. 127–140.
DATEDATE-1999-Junkkari #challenge #complexity #design #development #testing
Higher Product Complexity and Shorter Development Time — Continuous Challenge to Design and Test Environment (JJ), pp. 2–3.
ESOPESOP-1999-Thiemann #higher-order
Higher-Order Code Splicing (PT), pp. 243–257.
FLOPSFLOPS-1999-AntoyT #higher-order
Typed Higher-Order Narrowing without Higher-Order Strategies (SA, APT), pp. 335–353.
FLOPSFLOPS-1999-MarinIS #higher-order #lazy evaluation #on the
On Reducing the Search Space of Higher-Order Lazy Narrowing (MM, TI, TS), pp. 319–334.
FLOPSFLOPS-1999-MoorS #higher-order #program transformation
Higher Order Matching for Program Transformation (OdM, GS), pp. 209–224.
FMFM-v2-1999-JimenezO #algebra #framework #higher-order
An Algebraic Framework for Higher-Order Modules (RMJ, FO), pp. 1778–1797.
HCIHCI-CCAD-1999-YenWNL #case study #design #education #information management #learning
Design of a computer-mediated environment to capture and evaluate knowledge transfer and learning: a case study in a larger higher education class (SY, BW, JN, LJL), pp. 735–739.
CADECADE-1999-Benzmuller #higher-order
Extensional Higher-Order Paramodulation and RUE-Resolution (CB), pp. 399–413.
CADECADE-1999-Wierzbicki #complexity #higher-order
Complexity of the higher order matching (TW), pp. 82–96.
CSLCSL-1999-CompagnoniG #higher-order #symmetry #type system
Anti-Symmetry of Higher-Order Subtyping (ABC, HG), pp. 420–438.
ICLPICLP-1999-MomiglianoP #higher-order #problem
The Relative Complement Problem for Higher-Order Patterns (AM, FP), pp. 380–394.
LICSLICS-1999-Hofmann #analysis #higher-order #semantics #syntax
Semantical Analysis of Higher-Order Abstract Syntax (MH0), pp. 204–213.
LICSLICS-1999-JouannaudR #higher-order #recursion
The Higher-Order Recursive Path Ordering (JPJ, AR), pp. 402–411.
RTARTA-1999-DowekHK #first-order #higher-order #logic #named
HOL-λσ: An Intentional First-Order Expression of Higher-Order Logic (GD, TH, CK), pp. 317–331.
RTARTA-1999-Raamsdonk #higher-order
Higher-Order Rewriting (FvR), pp. 220–239.
PASTEPASTE-1998-WadellA #higher-order #performance #source code #visualisation
Visualizing the Performance of Higher-Order Programs (OW, JMA), pp. 75–82.
ICALPICALP-1998-Walukiewicz98a #higher-order #reduction
A Total AC-Compatible Reduction Ordering on Higher-Order Terms (DW), pp. 530–542.
FMFM-1998-Karlsen #framework #higher-order #integration #tool support
The UniForM WorkBench — A Higher Order Tool Integration Framework (EWK), pp. 266–280.
ICFPICFP-1998-HannanH #higher-order
Higher-Order Arity Raising (JH, PH), pp. 27–38.
IFLIFL-1998-Pape #higher-order
Higher Order Demand Propagation (DP), pp. 153–168.
KDDKDD-1998-SteegRW #correlation #detection #higher-order #multi #performance
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data (EWS, DAR, EW), pp. 112–120.
PPDPALP-PLILP-1998-Pitts #higher-order #semantics
Operational Versus Denotational Methods in the Semantics of Higher Order Languages (AMP), pp. 282–283.
POPLPOPL-1998-HannanH #higher-order
Higher-Order unCurrying (JH, PH), pp. 1–11.
POPLPOPL-1998-JagannathanTWW #alias #analysis #higher-order
Single and Loving It: Must-Alias Analysis for Higher-Order Languages (SJ, PT, SW, AKW), pp. 329–341.
CADECADE-1998-BenzmullerK #higher-order
Extensional Higher-Order Resolution (CB, MK), pp. 56–71.
CADECADE-1998-BenzmullerK98a #higher-order #proving #theorem proving
System Description: LEO — A Higher-Order Theorem Prover (CB, MK), pp. 139–144.
CADECADE-1998-Pagano #calculus #first-order #higher-order #reduction
X.R.S : Explicit Reduction Systems — A First-Order Calculus for Higher-Order Calculi (BP), pp. 72–87.
CADECADE-1998-RichardsonSG #higher-order #logic #proving #theorem proving
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam (JR, AS, IG), pp. 129–133.
LICSLICS-1998-Bernstein #congruence #higher-order #semantics #theorem
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages (KLB), pp. 153–164.
LICSLICS-1998-HermidaMP #higher-order #multi
Higher Dimensional Multigraphs (CH, MM, JP), pp. 199–206.
RTARTA-1998-DanvyR #higher-order #partial evaluation
Higher-Order Rewriting and Partial Evaluation (OD, KHR), pp. 286–301.
SASSAS-1997-PanitzS #automation #functional #higher-order #named #proving #source code #strict #termination
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language (SEP, MSS), pp. 345–360.
ICALPICALP-1997-CosmoG #composition #higher-order #on the #λ-calculus
On Modular Properties of Higher Order Extensional λ Calculi (RDC, NG), pp. 237–247.
ICFPICFP-1997-BlumeA #approach #higher-order #named #optimisation
λ-Splitting: A Higher-Order Approach to Cross-Module Optimizations (MB, AWA), pp. 112–124.
ICFPICFP-1997-Crary #higher-order #implementation #type system
Foundations for the Implementation of Higher-Order Subtyping (KC), pp. 125–135.
EDOCEDOC-1997-ClassenWH #adaptation #corba #higher-order #towards #workflow
Towards evolutionary and adaptive workflow systems-infrastructure support based on Higher-Order Object Nets and CORBA (IC, HW, YH), p. 300–?.
TOOLSTOOLS-ASIA-1997-Coplien97a #c++ #programming #using
Advanced C++ Programming Styles: Using C++ as a Higher-Level Language (JC), pp. 418–419.
PPDPALP-1997-KirchnerR #equation #higher-order #unification
Higher-Order Equational Unification via Explicit Substitutions (CK, CR), pp. 61–75.
PPDPALP-1997-Steggles #algebra #higher-order #specification
Parameterised Higher-Order Algebraic Specifications (LJS), pp. 76–98.
PPDPALP-1997-SuzukiNI #calculus #functional #higher-order #lazy evaluation #logic
Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language (TS, KN, TI), pp. 99–113.
LOPSTRLOPSTR-1997-NaishS #higher-order #re-engineering
A Higher Order Reconstruction of Stepwise Enhancement (LN, LS), pp. 245–262.
PPDPPLILP-1997-Mossin #graph #higher-order
Higher-Order Value Flow Graphs (CM), pp. 159–173.
POPLPOPL-1997-BourdoncleM #higher-order #multi #polymorphism
Type-Checking Higher-Order Polymorphic Multi-Methods (FB, SM), pp. 302–315.
POPLPOPL-1997-SeidlS #constraints #deforestation #higher-order
Constraints to Stop Higher-Order Deforestation (HS, MHS), pp. 400–413.
CADECADE-1997-Hickey #framework #higher-order #implementation #logic #named
Nuprl-Light: An Implementation Framework for Higher-Order Logics (JJH), pp. 395–399.
CSLCSL-1997-ComonJ #automaton #higher-order
Higher-Order Matching and Tree Automata (HC, YJ), pp. 157–176.
CSLCSL-1997-HartonasH #concurrent #functional #higher-order
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract) (CH, MH), pp. 239–254.
ICLPICLP-1997-Gonzalez-MorenoHR #functional #higher-order #logic programming
A Higher Order Rewriting Logic for Functional Logic Programming (JCGM, MTHG, MRA), pp. 153–167.
LICSLICS-1997-CervesatoP #higher-order #linear
Linear Higher-Order Pre-Unification (IC, FP), pp. 422–433.
LICSLICS-1997-Goubault-Larrecq #higher-order #unification
Ramified Higher-Order Unification (JGL), pp. 410–421.
LICSLICS-1997-McDowellM #higher-order #logic #reasoning #syntax
A Logic for Reasoning with Higher-Order Abstract Syntax (RM, DM), pp. 434–445.
TLCATLCA-1997-DespeyrouxPS #higher-order #recursion #syntax
Primitive Recursion for Higher-Order Abstract Syntax (JD, FP, CS), pp. 147–163.
ESOPESOP-1996-RohwedderP #higher-order #logic programming #source code #termination
Mode and Termination Checking for Higher-Order Logic Programs (ER, FP), pp. 296–310.
SASSAS-1996-AndersenH #analysis #functional #higher-order #partial evaluation #termination
Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language (PHA, CKH), pp. 67–82.
IFLIFL-1996-DebbabiFT #algorithm #analysis #concurrent #control flow #higher-order #source code #type system
A Type-Based Algorithm for the Control-Flow Analysis of Higher-Order Concurrent Programs (MD, AF, NT), pp. 247–266.
ICPRICPR-1996-YuCXY #3d #approximate #higher-order
3D shape and motion by SVD under higher-order approximation of perspective projection (HY, QC, GX, MY), pp. 456–460.
PPDPALP-1996-ManoO #higher-order #normalisation #term rewriting
Unique Normal Form Property of Higher-Order Rewriting Systems (KM, MO), pp. 269–283.
PPDPPLILP-1996-Hamilton #deforestation #higher-order
Higher Order Deforestation (GWH), pp. 213–227.
POPLPOPL-1996-Ashley #analysis #flexibility #higher-order
A Practical and Flexible Flow Analysis for Higher-Order Languages (JMA), pp. 184–194.
SACSAC-1996-SperberGT #higher-order
Bootstrapping higher-order program transformers from interpreters (MS, RG, PT), pp. 408–413.
ICLPJICSLP-1996-DowekHKP #higher-order #unification
Unification via Explicit Substitutions: The Case of Higher-Order Patterns (GD, TH, CK, FP), pp. 259–273.
LICSLICS-1996-CattaniS #higher-order
Higher Dimensional Transition Systems (GLC, VS), pp. 55–62.
RTARTA-1996-FettigL #finite #higher-order #unification #λ-calculus
Unification of Higher-Order patterns in a Simply Typed λ-Calculus with Finite Products and terminal Type (RF, BL), pp. 347–361.
RTARTA-1996-HanusP #higher-order
Higher-Order Narrowing with Definitional Trees (MH, CP), pp. 138–152.
RTARTA-1996-JouannaudR #higher-order #normalisation #recursion
A Recursive Path Ordering for Higher-Order Terms in η-Long β-Normal Form (JPJ, AR), pp. 108–122.
RTARTA-1996-Oostrom #higher-order #product line
Higher-Order Families (VvO), pp. 392–407.
RTARTA-1996-Virga #dependent type #higher-order
Higher-Order Superposition for Dependent Types (RV), pp. 123–137.
PEPMPEPM-1995-Goubault #automaton #higher-order #interpreter
Schedulers as Abstract Interpreter of Higher Dimensional Automata (EG), pp. 134–145.
PEPMPEPM-1995-MalmkjaerO #higher-order
Polyvariant Specialisation for Higher-Order, Block-Structured Languages (KM, ), pp. 66–76.
PEPMPEPM-1995-Sands #higher-order
Higher Order Expression Procedures (DS), pp. 178–189.
PLDIPLDI-1995-AikenFL #analysis #higher-order #memory management
Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages (AA, MF, RL), pp. 174–185.
SASSAS-1995-Mohnen #analysis #higher-order #inheritance #performance
Efficient Closure Utilisation by Higher-Order Inheritance Analysis (MM), pp. 261–278.
SASSAS-1995-Tofte #functional #higher-order
Region Inference for Higher-Order Functional Languages (MT), pp. 19–20.
AFPAFP-1995-Jones95 #functional #higher-order #morphism #polymorphism #programming
Functional Programming with Overloading and Higher-Order Polymorphism (MPJ), pp. 97–136.
PPDPPLILP-1995-NakaharaMI #calculus #functional #higher-order #logic programming
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming (KN, AM, TI), pp. 97–114.
POPLPOPL-1995-Biswas #higher-order
Higher-Order Functors with Transparent Signatures (SKB), pp. 154–163.
POPLPOPL-1995-JagannathanW #analysis #higher-order
A Unified Treatment of Flow Analysis in Higher-Order Languages (SJ, SW), pp. 393–407.
POPLPOPL-1995-Leroy #higher-order
Applicative Functors and Fully Transparent Higher-Order Modules (XL), pp. 142–153.
POPLPOPL-1995-SansomJ #functional #higher-order #profiling #strict
Time and Space Profiling for Non-Strict Higher-Order Functional Languages (PMS, SLPJ), pp. 355–366.
ICLPICLP-1995-NilssonH #higher-order #logic programming #source code
Constructing Logic Programs with Higher-Order Predicates (JFN, AH), p. 827.
ICLPILPS-1995-KuchenA #higher-order
Higher Order Babel (HK, JA), p. 633.
ICLPILPS-1995-Prehofer #call-by #functional #higher-order #logic programming
A Call-by-Need Strategy for Higher-Order Functional-Logic Programming (CP), pp. 147–161.
LICSLICS-1995-DowekHK #higher-order #unification
Higher-Order Unification via Explicit Substitutions (Extended Abstract) (GD, TH, CK), pp. 366–374.
RTARTA-1995-Boulton #higher-order #semantics #strict
A Restricted Form on Higher-Order Rewriting Applied to an HDL Semantics (RJB), pp. 309–323.
RTARTA-1995-LysneP #higher-order #term rewriting #termination
A Termination Ordering for Higher Order Rewrite System (OL, JP), pp. 26–40.
RTARTA-1995-Nipkow #higher-order #term rewriting
Higher-Order Rewrite Systems (Abstract) (TN), p. 256.
TLCATLCA-1995-DespeyrouxFH #coq #higher-order #syntax
Higher-Order Abstract Syntax in Coq (JD, APF, AH), pp. 124–138.
ESOPESOP-1994-MacQueenT #higher-order #semantics
A Semantics for Higher-Order Functors (DBM, MT), pp. 409–423.
PEPMPEPM-1994-Baker-Finch #higher-order #static analysis #type system
Type Theory and Projections for Higher-Order Static Analysis (CABF), pp. 43–52.
PEPMPEPM-1994-Thiemann #higher-order
Higher-Order Redundancy Elimination (PT), pp. 73–83.
ICALPICALP-1994-Hennessy #higher-order #modelling #process
Higher-Order Process and Their Models (MH), pp. 286–303.
LISPLFP-1994-StefanescuZ #analysis #equation #framework #functional #higher-order #source code
An Equational Framework for the Flow Analysis of Higher Order Functional Programs (DCS, YZ), pp. 318–327.
PPDPALP-1994-JonesR #functional #graph #higher-order
Higher-Order Minimal Functional Graphs (NDJ, MR), pp. 242–252.
PPDPPLILP-1994-Serrano #analysis #compilation #control flow #functional #higher-order #using
Using Higher-Order Control Flow Analysis When Compiling Functional Languages (MS), pp. 447–448.
POPLPOPL-1994-Bloom #communication #higher-order #named #λ-calculus
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (BB), pp. 339–347.
POPLPOPL-1994-HarperL #approach #higher-order
A Type-Theoretic Approach to Higher-Order Modules with Sharing (RH, ML), pp. 123–137.
POPLPOPL-1994-NielsonN #communication #concurrent #finite #higher-order #source code
Higher-Order Concurrent Programs with Finite Communication Topology (HRN, FN), pp. 84–97.
POPLPOPL-1994-Qian #equation #higher-order #logic programming
Higher-Order Equational Logic Programming (ZQ), pp. 254–267.
SACSAC-1994-RondogiannisW #data flow #hardware #higher-order #implementation
Higher-order dataflow and its implementation on stock hardware (PR, WWW), pp. 431–435.
CADECADE-1994-MullerW #composition #higher-order #theory and practice
Theory and Practice of Minimal Modular Higher-Order E-Unification (OM, FW), pp. 650–664.
CADECADE-1994-Prehofer #decidability #higher-order #problem #unification
Decidable Higher-Order Unification Problems (CP), pp. 635–649.
ICLPICLP-1994-CairesM #higher-order #logic programming #polymorphism #unification
Higher-Order Polymorphic Unification for Logic Programming (LC, LM), pp. 419–433.
ICLPICLP-1994-Reddy #aspect-oriented #higher-order #logic programming
Higher-order Aspects of Logic Programming (USR), pp. 402–418.
ICLPILPS-1994-SchulteS #concurrent #constraints #encapsulation #higher-order #programming
Encapsulated Search for Higher-order Concurrent Constraint Programming (CS, GS), pp. 505–520.
LICSLICS-1994-ColsonE #higher-order #on the
On Strong Stability and Higher-Order Sequentiality (LC, TE), pp. 103–108.
LICSLICS-1994-Prehofer #higher-order
Higher-Order Narrowing (CP), pp. 507–516.
PEPMPEPM-1993-Consel93a #higher-order #partial evaluation
A Tour of Schism: A Partial Evaluation System For Higher-Order Applicative Languages (CC), pp. 145–154.
PEPMPEPM-1993-Davis #analysis #higher-order
Higher-order Binding-time Analysis (KD), pp. 78–87.
PLDIPLDI-1993-Bourdoncle #debugging #higher-order #imperative
Abstract Debugging of Higher-Order Imperative Languages (FB), pp. 46–55.
ICALPICALP-1993-KannegantiC #higher-order #programming language #question #what
What is a Universal Higher-Order Programming Language? (RK, RC), pp. 682–695.
FPCAFPCA-1993-Jones #higher-order #morphism #polymorphism
A System of Constructor Classes: Overloading and Implicit Higher-Order Polymorphism (MPJ), pp. 52–64.
PPDPPLILP-1993-Rosendahl #higher-order #sequence
Higher-Order Chaotic Iteration Sequences (MR), pp. 332–345.
CSLCSL-1993-Milner #calculus #higher-order
Higher-Order Action Calculi (RM), pp. 238–260.
ICLPILPS-1993-Felty #definite clause grammar #higher-order #parsing #syntax
Definite Clause Grammars for Parsing Higher-Order Syntax (APF), p. 668.
RTARTA-1993-GuiO #algebra #higher-order #named #specification
LAMBDALG: Higher Order Algebraic Specification Language (YG, MO), pp. 462–466.
TLCATLCA-1993-BarbaneraF #higher-order #term rewriting
Combining First and Higher Order Rewrite Systems with Type Assignment Systems (FB, MF), pp. 60–74.
TLCATLCA-1993-JacobsM #dependent type #higher-order #logic #type system
Translating Dependent Type Theory into Higher Order Logic (BJ, TFM), pp. 209–229.
TLCATLCA-1993-Nipkow #confluence #higher-order #orthogonal #term rewriting
Orthogonal Higher-Order Rewrite Systems are Confluent (TN), pp. 306–317.
PEPMPEPM-1992-Chin #higher-order #lazy evaluation
Fully Lazy Higher-Order Removal (WNC), pp. 38–47.
PEPMPEPM-1992-RufW #analysis #control flow #higher-order #using
Improving the Accuracy of Higher-Order Specialization using Control Flow Analysis (ER, DW), pp. 67–74.
ICMLML-1992-FengM #higher-order #induction #logic #towards
Towards Inductive Generalization in Higher Order Logic (CF, SM), pp. 154–162.
PPDPALP-1992-Ait-Kaci #calculus #object-oriented
Outline of an Object-Oriented Calculus of Higher Type (Abstract) (HAK), pp. 1–2.
PPDPPLILP-1992-Hoa #bottom-up #higher-order #interpreter #logic programming #programming language
A Bottom-Up Interpreter for a Higher-Order Logic Programming Language (AHBH), pp. 326–340.
PPDPPLILP-1992-Reus #algebra #higher-order #implementation #specification
Implementing Higher-Order Functions in an Algebraic Specification Language with Narrowing (BR), pp. 483–484.
POPLPOPL-1992-BruceM #higher-order #modelling #morphism #polymorphism #recursion #type system
PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism (KBB, JCM), pp. 316–327.
POPLPOPL-1992-JagadeesanP #functional #higher-order #logic #semantics
Abstract Semantics for a Higher-Order Functional Language with Logic Variables (RJ, KP), pp. 355–366.
POPLPOPL-1992-Tofte #higher-order
Principal Signatures for Higher-Order Program Modules (MT), pp. 189–199.
CADECADE-1992-DoughertyJ #approach #combinator #higher-order #logic
A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract) (DJD, PJ), pp. 79–93.
CAVCAV-1992-HuDDY #specification #verification
Higher-Level Specification and Verification with BDDs (AJH, DLD, AJD, CHY), pp. 82–95.
CSLCSL-1992-Gavilanes-FrancoLR #higher-order #reasoning
Reasoning with Higher Order Partial Functions (AGF, FLC, MRA), pp. 167–181.
ICLPJICSLP-1992-QianW #higher-order
Higher-Order E-Unification for Arbitrary Theories (ZQ, KW), pp. 52–66.
DACDAC-1991-AmonB91a #case study #synthesis
Sizing Synchronization Queues: A Case Study in Higher Level Synthesis (TA, GB), pp. 690–693.
ESOPESOP-J-1990-Bondorf91 #automation #equation #higher-order #recursion
Automatic Autoprojection of Higher Order Recursive Equations (AB), pp. 3–34.
PLDIPLDI-1991-Reppy #concurrent #higher-order #named
CML: A Higher-Order Concurrent Language (JHR), pp. 293–305.
SASWSA-1991-CousotC #abstract interpretation #functional #higher-order #relational #source code
Relational Abstract Interpretation of Higher Order Functional Programs (extended abstract) (PC, RC), pp. 33–36.
FPCAFPCA-1991-Henglein #analysis #higher-order #performance #type inference
Efficient Type Inference for Higher-Order Binding-Time Analysis (FH), pp. 448–472.
ICMLML-1991-KowalczykFG #higher-order #network
Discovering Production Rules with Higher Order Neural Networks (AK, HLF, KG), pp. 158–162.
PPDPPLILP-1991-ChenW #abstraction #compilation #higher-order #logic programming
Compilation of Predicate Abstractions in Higher-Order Logic Programming (WC, DSW), pp. 287–298.
PPDPPLILP-1991-VogtSK #attribute grammar #evaluation #higher-order #incremental #performance
Efficient Incremental Evaluation of Higher order Attribute Grammars (HV, SDS, MFK), pp. 231–242.
POPLPOPL-1991-AbramskyJ #analysis #approach #higher-order #polymorphism #relational #strict
A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions (SA, TPJ), pp. 49–54.
POPLPOPL-1991-HengleinM #complexity #higher-order #type inference #λ-calculus
The Complexity of Type Inference for Higher-Order Typed λ Calculi (FH, HGM), pp. 119–130.
CAVCAV-1991-Nesi #higher-order #induction #logic #process #proving #specification
Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic (MN), pp. 288–298.
ICLPICLP-1991-ChengRS #metaprogramming #prolog
Higher Level Meta Programming in Qu-Prolog 3: 0 (ASKC, PJR, JS), pp. 285–298.
ICLPICLP-1991-Hagiya #higher-order #proving #theorem proving #unification
Higher-Order Unification as a Theorem Proving Procedure (MH), pp. 270–284.
ICLPISLP-1991-Wadge #higher-order #logic programming
Higher-Order Horn Logic Programming (WWW), pp. 289–303.
LICSLICS-1991-JouannaudO #algebra #execution #higher-order #specification
A Computation Model for Executable Higher-Order Algebraic Specification Languages (JPJ, MO), pp. 350–361.
LICSLICS-1991-Nipkow #higher-order
Higher-Order Critical Pairs (TN), pp. 342–349.
RTARTA-1991-NipkowQ #composition #higher-order
Modular Higher-Order E-Unification (TN, ZQ), pp. 200–214.
RTARTA-1991-Wolfram #equation #higher-order #unification
Rewriting, and Equational Unification: the Higher-Order Cases (DAW), pp. 25–36.
ESOPESOP-1990-Bondorf #automation #equation #higher-order #recursion
Automatic Autoprojection of Higher Order Recursive Equations (AB), pp. 70–87.
ESOPESOP-1990-GoldbergP #analysis #functional #higher-order #implementation #optimisation #stack
Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations (BG, YGP), pp. 152–160.
ESOPESOP-1990-Sands #analysis #complexity #higher-order #lazy evaluation
Complexity Analysis for a Lazy Higher-Order Language (DS), pp. 361–376.
PLDIPLDI-1990-TeitelbaumC #attribute grammar #editing #higher-order
Higher-Order Attribute Grammars and Editing Environments (TT, RC), pp. 197–208.
ICALPICALP-1990-JagadeesanP #calculus #formal method #higher-order #process
A Domain-Theoretic Model for a Higher-Order Process Calculus (RJ, PP), pp. 181–194.
PPDPALP-1990-Qian #algebra #higher-order
Higher-Order Order-Sorted Algebras (ZQ), pp. 86–100.
POPLPOPL-1990-Deutsch #alias #functional #higher-order #on the #specification
On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications (AD), pp. 157–168.
POPLPOPL-1990-HarperMM #higher-order
Higher-Order Modules and the Phase Distinction (RH, JCM, EM), pp. 341–354.
CADECADE-1990-Hagiya #higher-order #programming #proving #unification #using
Programming by Example and Proving by Example Using Higher-order Unification (MH), pp. 588–602.
CADECADE-1990-Snyder #higher-order
Higher Order E-Unification (WS), pp. 573–587.
CAVCAV-1990-LoewensteinD #higher-order #logic #multi #protocol #simulation #using #verification
Verification of a Multiprocessor Cache Protocol Using Simulation Relations and Higher-Order Logic (PL, DLD), pp. 302–311.
ICLPCLP-1990-Miller90 #higher-order #logic programming
Higher-Order Logic Programming (DM), p. 784.
ICLPCLP-1990-Sheng90 #higher-order #logic programming #relational
HIFUNLOG : Logic Programming with Higher-order Relational Functions (YHS), pp. 529–545.
HTHT-1989-EhrmannEMW #education #hypermedia
Hypertext and Higher Education: A Reality Check (SCE, SE, KM, RFEW), p. 393.
SIGMODSIGMOD-1989-KiferL #higher-order #inheritance #named #reasoning
F-Logic: A Higher-Order language for Reasoning about Objects, Inheritance, and Scheme (MK, GL), pp. 134–146.
PLDIPLDI-1989-VogtSK #attribute grammar #higher-order
Higher-Order Attribute Grammars (HV, SDS, MFK), pp. 131–145.
FPCAFPCA-1989-NielsonN #higher-order
Transformations on Higher-Order Functions (HRN, FN), pp. 129–143.
ICMLML-1989-DietzenP #framework #higher-order #logic
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization (SD, FP), pp. 447–449.
POPLPOPL-1989-Thomsen #calculus #communication #higher-order
A Calculus of Higher Order Communicating Systems (BT), pp. 143–154.
LICSLICS-1989-Goerdt #complexity #recursion
Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions (AG), pp. 364–374.
ICLPNACLP-1989-ChenKW #first-order #higher-order #logic programming #named #semantics
HiLog: A First-Order Semantics for Higher-Order Logic Programming Constructs (WC, MK, DSW), pp. 1090–1114.
RTARTA-1989-Elliott #higher-order #unification
Higher-order Unification with Dependent Function Types (CE), pp. 121–136.
PLDIPLDI-1988-PfenningE #higher-order #syntax
Higher-Order Abstract Syntax (FP, CE), pp. 199–208.
PLDIBest-of-PLDI-1988-Shivers88a #analysis #control flow #higher-order #lessons learnt
Higher-order control-flow analysis in retrospect: lessons learned, lessons abandoned (with retrospective) (OS), pp. 257–269.
LISPLFP-1988-Pfenning #higher-order #polymorphism #type inference #unification
Partial Polymorphic Type Inference and Higher-Order Unification (FP), pp. 153–163.
CADECADE-1988-DonatW #higher-order #learning #using
Learning and Applying Generalised Solutions using Higher Order Resolution (MRD, LAW), pp. 41–60.
CADECADE-1988-FeltyM #higher-order #logic programming #programming language #proving #specification #theorem proving
Specifying Theorem Provers in a Higher-Order Logic Programming Language (APF, DM), pp. 61–80.
CSLCSL-1988-Goerdt #complexity #recursion
Characterizing Complexity Classes by General Recursive Definitions in Higher Types (AG), pp. 99–117.
ICLPJICSCP-1988-HannanM88 #higher-order #implementation #unification
Uses of Higher-Order Unification for Implementing Program Transformers (JH, DM), pp. 942–959.
LICSLICS-1988-Breazu-Tannen88a #algebra #higher-order
Combining Algebra and Higher-Order Types (VT), pp. 82–90.
PLDIPLDI-1987-Danvy #higher-order #memory management
Memory allocation and higher-order functions (OD), pp. 241–252.
STOCSTOC-1987-KolaitisV #higher-order #problem
The Decision Problem for the Probabilities of Higher-Order Properties (PGK, MYV), pp. 425–435.
POPLPOPL-1987-FelleisenF #calculus #higher-order
A Calculus for Assignments in Higher-Order Languages (MF, DPF), pp. 314–325.
DACDAC-1986-TsuchiyaMITMY #design #logic #scalability
Establishment of higher level logic design for very large scale computer (YT, MM, YI, ET, TM, TY), pp. 366–371.
STOCSTOC-1986-Seidel
Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face (RS), pp. 404–413.
LISPLFP-1986-BoehmCRO #case study #higher-order #programming
Exact Real Arithmetic: A Case Study in Higher Order Programming (HJB, RC, MR, MJO), pp. 162–173.
POPLPOPL-1986-HudakY #analysis #higher-order #strict #λ-calculus
Higher-Order Strictness Analysis in Untyped λ Calculus (PH, JY), pp. 97–109.
CADECADE-1986-Andrews #higher-order #logic
Connections and Higher-Order Logic (PBA), pp. 1–4.
ICLPICLP-1986-MillerN86 #higher-order #logic programming
Higher-Order Logic Programming (DM, GN), pp. 448–462.
LICSLICS-1986-AmadioBL #equation #higher-order #λ-calculus
The Finitary Projection Model for Second Order λ Calculus and Solutions to Higher Order Domain Equations (RMA, KBB, GL), pp. 122–130.
FPCAFPCA-1985-Sheeran85 #architecture #array #design #higher-order #using
Designing Regular Array Architectures using Higher Order Functions (MS), pp. 220–237.
ICALPICALP-1978-DammF #on the #power of #recursion #self
On the Power of Self-Application and Higher Type-Recursion (WD, EF), pp. 177–191.
ICALPICALP-1977-Damm
Languages Defined by Higher Type Program Schemes (WD), pp. 164–179.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.