749 papers:
ESOP-2015-CastagnaI0B #calculus #pattern matching #xquery- A Core Calculus for XQuery 3.0 — Combining Navigational and Pattern Matching Approaches (GC, HI, KN, VB), pp. 232–256.
FoSSaCS-2015-CloustonG #calculus- Sequent Calculus in the Topos of Trees (RC, RG), pp. 133–147.
ICFP-2015-GaboardiP #algebra #λ-calculus- Algebras and coalgebras in the light affine λ calculus (MG, RP), pp. 114–126.
ECOOP-2015-ShinnarSH #calculus #compilation- A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization (AS, JS, MH), pp. 542–567.
POPL-2015-CraryS #calculus #memory management- A Calculus for Relaxed Memory (KC, MJS), pp. 623–636.
- POPL-2015-Tobisawa #λ-calculus
- A Meta λ Calculus with Cross-Level Computation (KT), pp. 383–393.
SAC-2015-AlrahmanNLTV #calculus #communication- A calculus for attribute-based communication (YAA, RDN, ML, FT, RV), pp. 1840–1845.
CADE-2015-Platzer #calculus #difference #logic- A Uniform Substitution Calculus for Differential Dynamic Logic (AP), pp. 467–481.
LICS-2015-Edalat #calculus #difference- Extensions of Domain Maps in Differential and Integral Calculus (AE), pp. 426–437.
- LICS-2015-Munch-Maccagnoni #representation #λ-calculus
- Polarised Intermediate Representation of λ Calculus with Sums (GMM, GS), pp. 127–140.
TLCA-2015-Assaf #π-calculus- Conservativity of Embeddings in the λ π Calculus Modulo Rewriting (AA0), pp. 31–44.
- TLCA-2015-GuerrieriPR #call-by #standard #λ-calculus
- Standardization of a Call-By-Value λ-Calculus (GG, LP, SRDR), pp. 211–225.
- TLCA-2015-Redmond #parametricity #polynomial #λ-calculus
- Polynomial Time in the Parametric λ Calculus (BFR), pp. 288–301.
- TLCA-2015-Santo #calculus #exclamation
- Curry-Howard for Sequent Calculus at Last! (JES), pp. 165–179.
DATE-2014-BanerjeeD #calculus #constraints #generative #random #realtime #sequence- Acceptance and random generation of event sequences under real time calculus constraints (KB, PD), pp. 1–6.
- ESOP-2014-BrunelGMZ #calculus
- A Core Quantitative Coeffect Calculus (AB, MG, DM, SZ), pp. 351–370.
- FoSSaCS-2014-Mio #calculus #similarity #μ-calculus
- Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus (MM), pp. 335–350.
- FoSSaCS-2014-MossakowskiT #calculus #specification
- A Relatively Complete Calculus for Structured Heterogeneous Specifications (TM, AT), pp. 441–456.
- FoSSaCS-2014-Padovani #linear #re-engineering #recursion #π-calculus
- Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types (LP), pp. 88–102.
PEPM-2014-Garcia-PerezNS #λ-calculus- Deriving interpretations of the gradually-typed λ calculus (ÁGP, PN, IS), pp. 157–168.
FLOPS-2014-Sacchini #calculus #linear- Linear Sized Types in the Calculus of Constructions (JLS), pp. 169–185.
ICALP-v2-2014-Mazza #λ-calculus- Non-uniform Polytime Computation in the Infinitary Affine λ-Calculus (DM), pp. 305–317.
- ICFP-2014-GrabmayerR #λ-calculus
- Maximal sharing in the λ calculus with letrec (CG, JR), pp. 67–80.
- ICFP-2014-PetricekOM #calculus #named
- Coeffects: a calculus of context-dependent computation (TP, DAO, AM), pp. 123–135.
ICEIS-v2-2014-ShumskyRW #calculus #execution #process- Processes Construction and π-calculus-based Execution and Tracing (LS, VR, VW), pp. 448–453.
ICPR-2014-VaradarajanV #calculus #geometry #representation #visual notation- 4D Space-Time Mereotopogeometry-Part Connectivity Calculus for Visual Object Representation (KMV, MV), pp. 4316–4321.
KR-2014-Bochman #calculus- Dynamic Causal Calculus (AB).
- KR-2014-EwinPV #calculus #reasoning
- Transforming Situation Calculus Action Theories for Optimised Reasoning (CJE, ARP, SV).
- KR-2014-LakemeyerL #calculus #decidability #reasoning
- Decidable Reasoning in a Fragment of the Epistemic Situation Calculus (GL, HJL).
- KR-2014-MarrellaMS #adaptation #calculus #named #process
- SmartPM: An Adaptive Process Management System through Situation Calculus, IndiGolog, and Classical Planning (AM, MM, SS).
- POPL-2014-CousotC #abstract interpretation #calculus
- A galois connection calculus for abstract interpretation (PC, RC), pp. 3–4.
- SAC-2014-Umatani #calculus #implementation
- Practical implementation techniques of ambient calculus in conventional dynamic languages (SU), pp. 1345–1351.
ICLP-J-2014-BogaertsJBCVD #calculus #linear #simulation #using- Simulating Dynamic Systems Using Linear Time Calculus Theories (BB, JJ, MB, BdC, JV, MD), pp. 477–492.
IJCAR-2014-Lindblad #calculus #higher-order #logic- A Focused Sequent Calculus for Higher-Order Logic (FL), pp. 61–75.
- LICS-CSL-2014-BojanczykDK #calculus #composition #model checking #theorem #μ-calculus
- Decomposition theorems and model-checking for the modal μ-calculus (MB, CD, SK), p. 10.
- LICS-CSL-2014-ChaudhuriG #calculus #fixpoint #similarity
- Equality and fixpoints in the calculus of structures (KC, NG), p. 10.
- LICS-CSL-2014-Padovani #concurrent #linear #π-calculus
- Deadlock and lock freedom in the linear π-calculus (LP), p. 10.
RTA-TLCA-2014-Czajka #confluence #induction #proving #λ-calculus- A Coinductive Confluence Proof for Infinitary λ-Calculus (LC), pp. 164–178.
- RTA-TLCA-2014-HondaYB #interactive #process #π-calculus
- Process Types as a Descriptive Tool for Interaction — Control and the π-Calculus (KH, NY, MB), pp. 1–20.
- RTA-TLCA-2014-NakazawaN #reduction #λ-calculus #μ-calculus
- Reduction System for Extensional Λμ Calculus (KN, TN), pp. 349–363.
- RTA-TLCA-2014-Schmidt-SchaussS #call-by #λ-calculus
- Applicative May- and Should-Simulation in the Call-by-Value λ Calculus with AMB (MSS, DS), pp. 379–394.
- RTA-TLCA-2014-Statman #λ-calculus
- Near Semi-rings and λ Calculus (RS), pp. 410–424.
FASE-2013-BradfieldS #calculus #game studies #qvt #μ-calculus- Enforcing QVT-R with μ-Calculus and Games (JCB, PS), pp. 282–296.
- FoSSaCS-2013-DreierELL #composition #on the #process #π-calculus
- On Unique Decomposition of Processes in the Applied π-Calculus (JD, CE, PL, YL), pp. 50–64.
TACAS-2013-MateescuS #model checking #model transformation #named #π-calculus- PIC2LNT: Model Transformation for Model Checking an Applied π-Calculus (RM, GS), pp. 192–198.
STOC-2013-BeckNT #calculus #polynomial #trade-off- Some trade-off results for polynomial calculus: extended abstract (CB, JN, BT), pp. 813–822.
- ICALP-v1-2013-FilmusLMNV #bound #calculus #comprehension #polynomial #towards
- Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds — (Extended Abstract) (YF, ML, MM, JN, MV), pp. 437–448.
- ICALP-v2-2013-Stirling #proving #λ-calculus
- Proof Systems for Retracts in Simply Typed λ Calculus (CS), pp. 398–409.
LATA-2013-DengZDZ #concurrent #π-calculus- The Buffered π-Calculus: A Model for Concurrent Languages (XD, YZ, YD, FZ), pp. 250–261.
IFM-2013-IshiiMN #automaton #calculus #hybrid #induction #verification- Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus (DI, GM, SN), pp. 139–153.
CAiSE-2013-BaryannisP #calculus #named #specification #web #web service- WSSL: A Fluent Calculus-Based Language for Web Service Specifications (GB, DP), pp. 256–271.
LOPSTR-2013-Saeedloei #encoding #logic #π-calculus- A Logical Encoding of Timed π-Calculus (NS), pp. 164–182.
PPDP-2013-AsadaHKHN #branch #calculus #finite #graph #graph transformation #monad- A parameterized graph transformation calculus for finite graphs with monadic branches (KA, SH, HK, ZH, KN), pp. 73–84.
- POPL-2013-Goyet #calculus
- The λ λ-Bar calculus: a dual calculus for unconstrained strategies (AG), pp. 155–166.
- SAC-2013-LaneseBF #approach #calculus #internet #process
- Internet of things: a process calculus approach (IL, LB, MDF), pp. 1339–1346.
CSL-2013-AfshariL #calculus #on the #μ-calculus- On closure ordinals for the modal μ-calculus (BA, GEL), pp. 30–44.
- CSL-2013-Kikuchi #nondeterminism #normalisation #proving #λ-calculus
- Proving Strong Normalisation via Non-deterministic Translations into Klop’s Extended λ-Calculus (KK), pp. 395–414.
- CSL-2013-KrishnaswamiD #calculus #parametricity #relational
- Internalizing Relational Parametricity in the Extensional Calculus of Constructions (NRK, DD), pp. 432–451.
- LICS-2013-AspertiL #cost analysis #λ-calculus
- The Cost of Usage in the λ-Calculus (AA, JJL), pp. 293–300.
- LICS-2013-CristescuKV #calculus #composition #semantics
- A Compositional Semantics for the Reversible p-Calculus (IC, JK, DV), pp. 388–397.
- LICS-2013-FacchiniVZ #calculus #theorem #μ-calculus
- A Characterization Theorem for the Alternation-Free Fragment of the Modal μ-Calculus (AF, YV, FZ), pp. 478–487.
- LICS-2013-GundersenHP #λ-calculus
- Atomic λ Calculus: A Typed λ-Calculus with Explicit Sharing (TG, WH, MP), pp. 311–320.
- LICS-2013-Sacchini #calculus #type system
- Type-Based Productivity of Stream Definitions in the Calculus of Constructions (JLS), pp. 233–242.
- RTA-2013-GrabmayerR #λ-calculus #μ-calculus
- Expressibility in the λ Calculus with μ (CG, JR), pp. 206–222.
- RTA-2013-Schmidt-SchaussMS #lazy evaluation #λ-calculus
- Extending Abramsky’s Lazy λ Calculus: (Non)-Conservativity of Embeddings (MSS, EM, DS), pp. 239–254.
- RTA-2013-TushkanovaRGK #automation #calculus #decidability
- Automatic Decidability: A Schematic Calculus for Theories with Counting Operators (ET, CR, AG, OK), pp. 303–318.
- TLCA-2013-Breuvart #relational #λ-calculus
- The Resource λ Calculus Is Short-Sighted in Its Relational Model (FB), pp. 93–108.
VMCAI-2013-MouraJ #calculus #satisfiability- A Model-Constructing Satisfiability Calculus (LMdM, DJ), pp. 1–12.
- ESOP-2012-ChangF #call-by #revisited #λ-calculus
- The Call-by-Need λ Calculus, Revisited (SC, MF), pp. 128–147.
- FASE-2012-BradfieldS #calculus #qvt #recursion #μ-calculus
- Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal μ Calculus (JCB, PS), pp. 194–208.
- FoSSaCS-2012-CrafaVY #parallel #semantics #π-calculus
- Event Structure Semantics of Parallel Extrusion in the π-Calculus (SC, DV, NY), pp. 225–239.
PLDI-2012-OliveiraSCLY #calculus #programming- The implicit calculus: a new foundation for generic programming (BCdSO, TS, WC, WL, KY), pp. 35–44.
SAS-2012-CalvertM #analysis #calculus #control flow- Control Flow Analysis for the Join Calculus (PC, AM), pp. 181–197.
- FLOPS-2012-Hirai #logic #λ-calculus
- A λ Calculus for Gödel-Dummett Logic Capturing Waitfreedom (YH), pp. 151–165.
SEFM-2012-ZhaoZZH #calculus- A Denotational Model for Instantaneous Signal Calculus (YZ, LZ, HZ, JH), pp. 126–140.
- ICFP-2012-ChenEW #type system #λ-calculus
- An error-tolerant type system for variational λ calculus (SC, ME, EW), pp. 29–40.
- KR-2012-GiacomoLP #bound #calculus #decidability #verification
- Bounded Situation Calculus Action Theories and Decidable Verification (GDG, YL, FP).
TOOLS-EUROPE-J-2011-IngesmanE12 #calculus #java #morphism #polymorphism- Lifted Java: A Minimal Calculus for Translation Polymorphism (MDI, EE), pp. 1–23.
GPCE-2012-WalkingshawE #calculus #implementation #modelling- A calculus for modeling and implementing variation (EW, ME), pp. 132–140.
- PPDP-2012-Madet #multi #polynomial #thread #λ-calculus
- A polynomial time λ-calculus with multithreading and side effects (AM), pp. 55–66.
- PPDP-2012-MonjarazM #haskell #π-calculus
- From the π-calculus to flat GHC (RM, JM), pp. 163–172.
- CSL-2012-CarraroS #consistency #equation #formal method #modelling #on the #λ-calculus
- On the equational consistency of order-theoretic models of the λ-calculus (AC, AS), pp. 152–166.
- CSL-2012-ChaudhuriHM #approach #calculus
- A Systematic Approach to Canonicity in the Classical Sequent Calculus (KC, SH, DM), pp. 183–197.
- ICLP-J-2012-BaralDGG #algorithm #correctness #programming #set #λ-calculus
- Typed answer set programming λ calculus theories and correctness of inverse λ algorithms with respect to them (CB, JD, MAG, AG), pp. 775–791.
- IJCAR-2012-EchenimP #calculus #generative
- A Calculus for Generating Ground Explanations (ME, NP), pp. 194–209.
- LICS-2012-Klop #term rewriting #λ-calculus
- Term Rewriting and λ Calculus (JWK), p. 12.
- LICS-2012-Mazza #λ-calculus
- An Infinitary Affine λ-Calculus Isomorphic to the Full λ-Calculus (DM), pp. 471–480.
- LICS-2012-PierardS #calculus #distributed #higher-order
- A Higher-Order Distributed Calculus with Name Creation (AP, ES), pp. 531–540.
- RTA-2012-Terui #complexity #evaluation #semantics #λ-calculus
- Semantic Evaluation, Intersection Types and Complexity of Simply Typed λ Calculus (KT), pp. 323–338.
ASE-2011-Hall #calculus #tool support- The Capture Calculus Toolset (RJH), pp. 628–632.
DocEng-2011-Vion-Dury #calculus #editing #xml- A generic calculus of XML editing deltas (JYVD), pp. 113–120.
- FoSSaCS-2011-Mio #calculus #independence #probability #μ-calculus
- Probabilistic Modal μ-Calculus with Independent Product (MM), pp. 290–304.
- FoSSaCS-2011-PierardS #bisimulation #calculus #distributed #higher-order #process
- Sound Bisimulations for Higher-Order Distributed Process Calculus (AP, ES), pp. 123–137.
- PLDI-2011-PerezR #calculus #logic #proving #theorem proving
- Separation logic + superposition calculus = heap theorem prover (JANP, AR), pp. 556–566.
- ICALP-v2-2011-FischerK #calculus #hybrid #linear #model checking #μ-calculus
- Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems (DF, LK), pp. 404–415.
- IFM-J-2009-Weiss11 #abstraction #calculus #logic
- Predicate abstraction in a program logic calculus (BW), pp. 861–876.
CEFP-2011-MichaelsonG #calculus #multi #reasoning- Reasoning about Multi-process Systems with the Box Calculus (GM, GG), pp. 279–338.
CIKM-2011-VirgilioM #calculus #data analysis #using- RFID data analysis using tensor calculus for supply chain management (RDV, FM), pp. 1743–1748.
SEKE-2011-GregoriadesLP11a #calculus #risk management #using- Project Risk Management Using Event Calculus(S) (AG, VPL, PP), pp. 335–338.
BX-2011-Schmitt #higher-order #π-calculus- Reversible Higher Order π Calculus (AS), p. 63.
- TOOLS-EUROPE-2011-IngesmanE #calculus #java #morphism #polymorphism
- Lifted Java: A Minimal Calculus for Translation Polymorphism (MDI, EE), pp. 179–193.
- PPDP-2011-AlvesFFM #recursion #λ-calculus
- Linearity and recursion in a typed λ-calculus (SA, MF, MF, IM), pp. 173–182.
- PPDP-2011-Guenot #proving #reduction #λ-calculus
- Nested proof search as reduction in the λ-calculus (NG), pp. 183–194.
QAPL-2011-SongNN #probability #π-calculus- A Stochastic Broadcast π-Calculus (LS, FN, BFN), pp. 74–88.
GTTSE-2011-ErwigW #calculus #programming- Variation Programming with the Choice Calculus (ME, EW), pp. 55–100.
CAV-2011-ChinGVLCQ #calculus #verification- A Specialization Calculus for Pruning Disjunctive Predicates to Support Verification (WNC, CG, RV, QLL, FC, SQ), pp. 293–309.
- CSL-2011-BucciarelliCEM #abstraction #calculus #testing
- Full Abstraction for Resource Calculus with Tests (AB, AC, TE, GM), pp. 97–111.
- CSL-2011-ChaudhuriGS #calculus
- The Focused Calculus of Structures (KC, NG, LS), pp. 159–173.
- CSL-2011-Ehrhard #difference #λ-calculus
- Resource λ-Calculus: the Differential Viewpoint (TE), p. 1.
- RTA-2011-GrathwohlKPS #graph #named #reduction #term rewriting #visualisation #λ-calculus
- Anagopos: A Reduction Graph Visualizer for Term Rewriting and λ Calculus (NBBG, JK, JDP, JGS), pp. 61–70.
- RTA-2011-SeveriV #axiom #λ-calculus
- Weakening the Axiom of Overlap in Infinitary λ Calculus (PS, FJdV), pp. 313–328.
- TLCA-2011-BakelBd #λ-calculus #μ-calculus
- A Filter Model for the λμ-Calculus — (Extended Abstract) (SvB, FB, Ud), pp. 213–228.
- TLCA-2011-BourreauS #game studies #semantics #λ-calculus
- Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus (PB, SS), pp. 61–75.
- TLCA-2011-MadetA #multi #thread #λ-calculus
- An Elementary Affine λ-Calculus with Multithreading and Side Effects (AM, RMA), pp. 138–152.
- TLCA-2011-ManzonettoP #theorem #λ-calculus
- Böhm’s Theorem for Resource λ Calculus through Taylor Expansion (GM, MP), pp. 153–168.
- TLCA-2011-Roversi #linear #λ-calculus
- Linear λ Calculus and Deep Inference (LR), pp. 184–197.
- DocEng-2010-Vion-Dury #calculus #difference #documentation #editing #towards #xml
- Diffing, patching and merging XML documents: toward a generic calculus of editing deltas (JYVD), pp. 191–194.
- ESOP-2010-SouleHGGAKW #calculus
- A Universal Calculus for Stream Processing Languages (RS, MH, RG, BG, HA, VK, KLW), pp. 507–528.
- FoSSaCS-2010-CateF #calculus #finite #proving #μ-calculus
- An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (BtC, GF), pp. 161–175.
- FoSSaCS-2010-EggerMS #calculus #continuation
- Linearly-Used Continuations in the Enriched Effect Calculus (JE, REM, AS), pp. 18–32.
- FoSSaCS-2010-PaganiR #λ-calculus
- Solvability in Resource λ-Calculus (MP, SRDR), pp. 358–373.
- TACAS-2010-MoyA #calculus #problem #realtime
- Arrival Curves for Real-Time Calculus: The Causality Problem and Its Solutions (MM, KA), pp. 358–372.
- FLOPS-2010-Abel #calculus #evaluation #normalisation #towards
- Towards Normalization by Evaluation for the βη-Calculus of Constructions (AA), pp. 224–239.
- FLOPS-2010-KetemaS #bound #diagrams #term rewriting #λ-calculus
- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.
- FLOPS-2010-Saurin #standard #λ-calculus #μ-calculus
- Standardization and Böhm Trees for λμ-Calculus (AS), pp. 134–149.
- LATA-2010-Lin #calculus #complexity
- Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness (ZL0), pp. 414–425.
- IFM-2010-MateescuS #π-calculus
- Translating π-Calculus into LOTOS NT (RM, GS), pp. 229–244.
- SEFM-2010-GallardoS #calculus #verification #μ-calculus
- Verification of Dynamic Data Tree with μ-calculus Extended with Separation (MdMG, DS), pp. 211–221.
- ICFP-2010-ReedP #calculus #difference #distance #privacy
- Distance makes the types grow stronger: a calculus for differential privacy (JR, BCP), pp. 157–168.
ICGT-2010-GadducciLV #calculus #higher-order #semantics #μ-calculus- Counterpart Semantics for a Second-Order μ-Calculus (FG, ALL, AV), pp. 282–297.
- ICGT-2010-PoskittP #calculus #graph #hoare #source code
- A Hoare Calculus for Graph Programs (CMP, DP), pp. 139–154.
- KR-2010-BaumannBSTZ #calculus
- State Defaults and Ramifications in the Unifying Action Calculus (RB, GB, HS, MT, VZ).
- KR-2010-GiacomoLP #calculus #game studies #reasoning #representation #source code
- Situation Calculus Based Programs for Representing and Reasoning about Game Structures (GDG, YL, ARP).
- ECOOP-2010-FraineES #aspect-oriented #calculus
- Essential AOP: The A Calculus (BDF, EE, MS), pp. 101–125.
- QAPL-2010-AltisenLM #automaton #calculus #component #evaluation #interface #performance #realtime #using
- Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata (KA, YL, MM), pp. 16–33.
- QAPL-2010-CoppoDDGT #calculus #probability
- Stochastic Calculus of Wrapped Compartments (MC, FD, MD, EG, AT), pp. 82–98.
- SAC-2010-ChokshiB #analysis #calculus #performance #realtime #revisited #using
- Performance analysis of FlexRay-based systems using real-time calculus, revisited (DBC, PB), pp. 351–356.
PPoPP-2010-LeeP #calculus #parallel- Featherweight X10: a core calculus for async-finish parallelism (JKL, JP), pp. 25–36.
- CSL-2010-AccattoliK #λ-calculus
- The Structural λ-Calculus (BA, DK), pp. 381–395.
- CSL-2010-Hetzl #calculus #representation
- A Sequent Calculus with Implicit Term Representation (SH), pp. 351–365.
- CSL-2010-KuncakPS #calculus #data type #order #set
- Ordered Sets in the Calculus of Data Structures (VK, RP, PS), pp. 34–48.
- ICLP-2010-Guenot10 #calculus #linear #logic #proving
- Focused Proof Search for Linear Logic in the Calculus of Structures (NG), pp. 84–93.
- ICLP-2010-Snow10 #λ-calculus
- Realizing the Dependently Typed λ Calculus (ZS), pp. 294–299.
- IJCAR-2010-AbourbihBBM #automation #calculus
- A Single-Significant-Digit Calculus for Semi-Automated Guesstimation (JAA, LB, AB, FM), pp. 354–368.
- IJCAR-2010-BrilloutKRW #calculus #quantifier
- An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic (AB, DK, PR, TW), pp. 384–399.
- IJCAR-2010-Schack-NielsenS #linear #λ-calculus
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus (ASN, CS), pp. 1–14.
- LICS-2010-BartolettiZ #calculus #process
- A Calculus of Contracting Processes (MB, RZ), pp. 332–341.
- LICS-2010-Milius #calculus #finite
- A Sound and Complete Calculus for Finite Stream Circuits (SM), pp. 421–430.
- RTA-2010-GuglielmiGP #calculus #proving
- A Proof Calculus Which Reduces Syntactic Bureaucracy (AG, TG, MP), pp. 135–150.
- RTA-2010-Schmidt-SchaussSM #call-by #simulation #λ-calculus
- Simulation in the Call-by-Need λ-Calculus with letrec (MSS, DS, EM), pp. 295–310.
- VMCAI-2010-KuncakPSW #calculus #data type
- Building a Calculus of Data Structures (VK, RP, PS, TW), pp. 26–44.
CBSE-2009-LauO #calculus #component #composition #encapsulation- Control Encapsulation: A Calculus for Exogenous Composition of Software Components (KKL, MO), pp. 121–139.
WRLA-2008-AndreiL09 #calculus #proving- Strategy-Based Proof Calculus for Membrane Systems (OA, DL), pp. 23–43.
- WRLA-2008-HolenJW09 #calculus #first-order #maude #proving
- Proof Search for the First-Order Connection Calculus in Maude (BH, EBJ, AW), pp. 173–188.
- FoSSaCS-2009-FossatiV #calculus
- The Calculus of Handshake Configurations (LF, DV), pp. 227–241.
- PEPM-2009-DavidGC #calculus #exception #optimisation
- Translation and optimization for a core calculus with exceptions (CD, CG, WNC), pp. 41–50.
- PLDI-2009-TorreMP #calculus #fixpoint #recursion #source code #using
- Analyzing recursive programs using a fixed-point calculus (SLT, PM, GP), pp. 211–222.
DLT-2009-Meinecke #calculus #word #μ-calculus- A Weighted μ-Calculus on Words (IM), pp. 384–395.
- ICALP-v2-2009-AcciaiB #behaviour #infinity #safety #π-calculus
- Deciding Safety Properties in Infinite-State π-Calculus via Behavioural Types (LA, MB), pp. 31–42.
- ICALP-v2-2009-KobayashiO #calculus #complexity #model checking #recursion #μ-calculus
- Complexity of Model Checking Recursion Schemes for Fragments of the Modal μ-Calculus (NK, CHLO), pp. 223–234.
- ICALP-v2-2009-LagoM #on the #term rewriting #λ-calculus
- On Constructor Rewrite Systems and the λ-Calculus (UDL, SM), pp. 163–174.
- IFM-2009-Weiss #abstraction #calculus #logic
- Predicate Abstraction in a Program Logic Calculus (BW), pp. 136–150.
- ECOOP-2009-LagorioSZ #calculus #composition
- Featherweight Jigsaw: A Minimal Core Calculus for Modular Composition of Classes (GL, MS, EZ), pp. 244–268.
- PPDP-2009-CooperW #calculus
- The RPC calculus (EC, PW), pp. 231–242.
- QAPL-2009-BortolussiV #calculus #named
- CoBiC: Context-dependent Bioambient Calculus (LB, MGV), pp. 187–201.
- POPL-2009-ElmasQT #calculus
- A calculus of atomic actions (TE, SQ, ST), pp. 2–15.
- CADE-2009-NguyenS #calculus #logic
- A Tableau Calculus for Regular Grammar Logics with Converse (LAN, AS), pp. 421–436.
- CADE-2009-ZhangHD #calculus
- A Refined Resolution Calculus for CTL (LZ, UH, CD), pp. 245–260.
- CSL-2009-CirsteaKP #algebra #calculus #μ-calculus
- EXPTIME Tableaux for the Coalgebraic μ-Calculus (CC, CK, DP), pp. 179–193.
- CSL-2009-EggerMS #calculus #linear
- Enriching an Effect Calculus with Linear Types (JE, REM, AS), pp. 240–254.
- CSL-2009-Sumii #equivalence #polymorphism #λ-calculus
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References (ES), pp. 455–469.
- CSL-2009-Tatsuta #calculus #commutative #first-order
- Non-Commutative First-Order Sequent Calculus (MT), pp. 470–484.
- LICS-2009-CarraroS #reflexive #λ-calculus
- Reflexive Scott Domains are Not Complete for the Extensional λ Calculus (AC, AS), pp. 91–100.
- LICS-2009-Dominguez #calculus #logic #polymorphism #similarity
- Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus (LD), pp. 81–90.
- LICS-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.
- LICS-2009-LiangM #calculus #proving
- A Unified Sequent Calculus for Focused Proofs (CL, DM), pp. 355–364.
- RTA-2009-KimuraT #calculus #induction
- Dual Calculus with Inductive and Coinductive Types (DK, MT), pp. 224–238.
- TLCA-2009-HerbelinZ #call-by #deduction #λ-calculus
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form (HH, SZ), pp. 142–156.
- TLCA-2009-Petit #polymorphism #type system #λ-calculus
- A Polymorphic Type System for the λ-Calculus with Constructors (BP), pp. 234–248.
- ESOP-2008-BuscemiM #bisimulation #concurrent #constraints #π-calculus
- Open Bisimulation for the Concurrent Constraint π-Calculus (MGB, UM), pp. 254–268.
- ESOP-2008-VieiraCS #calculus
- The Conversation Calculus: A Model of Service-Oriented Computation (HTV, LC, JCS), pp. 269–283.
- FoSSaCS-2008-BarrasB #calculus #dependent type #programming language
- The Implicit Calculus of Constructions as a Programming Language with Dependent Types (BB, BB), pp. 365–379.
- FoSSaCS-2008-GianantonioHL #higher-order #λ-calculus
- RPO, Second-Order Contexts, and λ-Calculus (PDG, FH, ML), pp. 334–349.
- FoSSaCS-2008-SelingerV #call-by #λ-calculus
- A Linear-non-Linear Model for a Computational Call-by-Value λ Calculus (Extended Abstract) (PS, BV), pp. 81–96.
- ICALP-B-2008-NeubauerT #calculus
- Placement Inference for a Client-Server Calculus (MN, PT), pp. 75–86.
- SEFM-2008-FranzleH #approximate #calculus #model checking #performance
- Efficient Model Checking for Duration Calculus Based on Branching-Time Approximations (MF, MRH), pp. 63–72.
- SEFM-2008-OliveiraGC #calculus #named #refinement
- CRefine: Support for the Circus Refinement Calculus (MO, ACG, CGdC), pp. 281–290.
SFM-2008-BarbutiCMMP #calculus #sequence- The Calculus of Looping Sequences (RB, GC, AMS, PM, GP), pp. 387–423.
- SFM-2008-VersariG #calculus #implementation #process
- pi@: A pi-Based Process Calculus for the Implementation of Compartmentalised Bio-inspired Calculi (CV, RG), pp. 449–506.
- ICFP-2008-ChargueraudP #calculus #functional
- Functional translation of a calculus of capabilities (AC, FP), pp. 213–224.
- KR-2008-KellyP #calculus
- Complex Epistemic Modalities in the Situation Calculus (RFK, ARP), pp. 611–620.
- KR-2008-Petrick #calculus #composition
- Cartesian Situations and Knowledge Decomposition in the Situation Calculus (RPAP), pp. 629–639.
- GPCE-2008-ApelKL #calculus #feature model #java #programming #refinement
- Feature featherweight java: a calculus for feature-oriented programming and stepwise refinement (SA, CK, CL), pp. 101–112.
- SAC-2008-Willassen #calculus #using
- Using simplified event calculus in digital investigation (SYW), pp. 1438–1442.
ICSE-2008-ChenDS #calculus #verification- A verification system for timed interval calculus (CC, JSD, JS), pp. 271–280.
- CSL-2008-Berardid #calculus
- A Calculus of Realizers for EM1 Arithmetic (Extended Abstract) (SB, Ud), pp. 215–229.
- CSL-2008-ColcombetL #calculus #problem #μ-calculus
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (TC, CL), pp. 416–430.
- CSL-2008-Fontaine #calculus #μ-calculus
- Continuous Fragment of the μ-Calculus (GF), pp. 139–153.
- IJCAR-2008-HofnerS #automation #calculus #on the
- On Automating the Calculus of Relations (PH, GS), pp. 50–66.
- LICS-2008-Beffara #algebra #calculus #process
- An Algebraic Process Calculus (EB), pp. 130–141.
- LICS-2008-Riis #calculus #complexity #on the #polynomial #proving
- On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity (SR), pp. 272–283.
- RTA-2008-ArrighiD #algebra #confluence #encoding #higher-order #λ-calculus
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence (PA, GD), pp. 17–31.
- RTA-2008-Schmidt-SchaussM #call-by #finite #nondeterminism #simulation #λ-calculus
- A Finite Simulation Method in a Non-deterministic Call-by-Need λ-Calculus with Letrec, Constructors, and Case (MSS, EM), pp. 321–335.
- RTA-2008-Ueda #encoding #graph grammar #λ-calculus
- Encoding the Pure λ Calculus into Hierarchical Graph Rewriting (KU), pp. 392–408.
TAP-2008-Cao #equivalence #finite #higher-order #π-calculus- Equivalence Checking for a Finite Higher Order π-Calculus (ZC), pp. 30–47.
- WRLA-J-2004-CirsteaFK07 #calculus #constraints
- A rho-calculus of explicit constraint application (HC, GF, CK), pp. 37–72.
- WRLA-2006-CirsteaHW07 #calculus
- Distributive rho-calculus (HC, CH, BW), pp. 95–111.
- ESOP-2007-AcciaiBD #calculus #concurrent #transaction
- A Concurrent Calculus with Atomic Transactions (LA, MB, SDZ), pp. 48–63.
- ESOP-2007-LapadulaPT #calculus #distributed #web #web service
- A Calculus for Orchestration of Web Services (AL, RP, FT), pp. 33–47.
- ESOP-2007-SuenagaK #analysis #calculus #concurrent #type system
- Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts (KS, NK), pp. 490–504.
- ESOP-2007-Versari #analysis #calculus #comparative
- A Core Calculus for a Comparative Analysis of Bio-inspired Calculi (CV), pp. 411–425.
- FoSSaCS-2007-BengtsonP #formal method #logic #using #π-calculus
- Formalising the π-Calculus Using Nominal Logic (JB, JP), pp. 63–77.
- FoSSaCS-2007-BertolissiK #calculus #combinator #reduction
- The Rewriting Calculus as a Combinatory Reduction System (CB, CK), pp. 78–92.
- FoSSaCS-2007-HirschkoffP #congruence #π-calculus
- A Distribution Law for CCS and a New Congruence Result for the π-Calculus (DH, DP), pp. 228–242.
- PLDI-2007-Chlipala #assembly #compilation #λ-calculus
- A certified type-preserving compiler from λ calculus to assembly language (AC), pp. 54–65.
- ICALP-2007-KobayashiS #behaviour #calculus #type system
- Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π -Calculus (NK, TS), pp. 740–751.
- SEFM-2007-AlhadidiBDB #aspect-oriented #λ-calculus
- An AOP Extended λ-Calculus (DA, NB, MD, PB), pp. 183–194.
- CEFP-2007-CsornyeiD #λ-calculus
- An Introduction to the λ Calculus (ZC, GD), pp. 87–111.
- CEFP-2007-Kluge #λ-calculus
- Abstract λ-Calculus Machines (WEK), pp. 112–157.
- PPDP-2007-AmadioD #π-calculus
- Feasible reactivity in a synchronous π-calculus (RMA, FD), pp. 221–230.
- QAPL-2007-VaraccaY #probability #π-calculus
- Probabilistic π-Calculus and Event Structures (DV, NY), pp. 147–166.
- POPL-2007-Murthy #design #enterprise #programming language #λ-calculus
- Advanced programming language design in enterprise software: a λ-calculus theorist wanders into a datacenter (CM), pp. 263–264.
- CSL-2007-BlanquiJS #calculus #induction
- Building Decision Procedures in the Calculus of Inductive Constructions (FB, JPJ, PYS), pp. 328–342.
- CSL-2007-GaboardiR #calculus
- A Soft Type Assignment System for λ -Calculus (MG, SRDR), pp. 253–267.
- CSL-2007-GaintzarainHLNO #calculus #invariant
- A Cut-Free and Invariant-Free Sequent Calculus for PLTL (JG, MH, PL, MN, FO), pp. 481–495.
- CSL-2007-KorovinV #calculus #linear
- Integrating Linear Arithmetic into Superposition Calculus (KK, AV), pp. 223–237.
- CSL-2007-Miquel #calculus
- Classical Program Extraction in the Calculus of Constructions (AM), pp. 313–327.
- LICS-2007-BonsangueK #logic #π-calculus
- π-Calculus in Logical Form (MMB, AK), pp. 303–312.
- LICS-2007-JurdzinskiL #calculus #μ-calculus
- Alternation-free modal μ-calculus for data trees (MJ, RL), pp. 131–140.
- RTA-2007-Tatsuta #λ-calculus #μ-calculus
- The Maximum Length of μ-Reduction in λμ-Calculus (MT), pp. 359–373.
- TAP-2007-RummerS #calculus #java #logic #proving #source code #using
- Proving Programs Incorrect Using a Sequent Calculus for Java Dynamic Logic (PR, MAS), pp. 41–60.
- TLCA-2007-BlumO #λ-calculus
- The Safe λ Calculus (WB, CHLO), pp. 39–53.
- TLCA-2007-Boulme #calculus #refinement
- Intuitionistic Refinement Calculus (SB), pp. 54–69.
- TLCA-2007-CousineauD #calculus #type system
- Embedding Pure Type Systems in the λ-π-Calculus Modulo (DC, GD), pp. 102–117.
- TLCA-2007-DavidN #calculus #equation #normalisation #proving #recursion
- An Arithmetical Proof of the Strong Normalization for the λ -Calculus with Recursive Equations on Types (RD, KN), pp. 84–101.
- TLCA-2007-FaggianP #linear #π-calculus
- Ludics is a Model for the Finitary Linear π-Calculus (CF, MP), pp. 148–162.
- TLCA-2007-IntrigilaS #calculus
- The ω-Rule is Π¹₁-Complete in the λβ-Calculus (BI, RS), pp. 178–193.
- TLCA-2007-Vaux #λ-calculus #μ-calculus
- Convolution λμ-Calculus (LV), pp. 381–395.
- ESOP-2006-BrobergS #calculus #policy #towards
- Flow Locks: Towards a Core Calculus for Dynamic Flow Policies (NB, DS), pp. 180–196.
- ESOP-2006-JayK #calculus
- Pure Pattern Calculus (CBJ, DK), pp. 100–114.
- ESOP-2006-SummersB #calculus #morphism #polymorphism
- Approaches to Polymorphism in Classical Sequent Calculus (AJS, SvB), pp. 84–99.
- FASE-2006-KobW #calculus #debugging #using
- Fundamentals of Debugging Using a Resolution Calculus (DK, FW), pp. 278–292.
- FoSSaCS-2006-BlanquiKR #confluence #on the #λ-calculus
- On the Confluence of λ-Calculus with Conditional Rewriting (FB, CK, CR), pp. 382–397.
- FoSSaCS-2006-Cao #bisimulation #higher-order #π-calculus
- More on Bisimulations for Higher Order π-Calculus (ZC), pp. 63–78.
- FoSSaCS-2006-Rohde #calculus #on the #μ-calculus
- On the μ-Calculus Augmented with Sabotage (PR), pp. 142–156.
- TACAS-2006-YangBR #verification #π-calculus
- Parameterized Verification of π-Calculus Systems (PY, SB, CRR), pp. 42–57.
- ICALP-v1-2006-KojevnikovI #bound #calculus #proving
- Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies (AK, DI), pp. 323–334.
- ICALP-v2-2006-Levy #λ-calculus
- Jumbo λ-Calculus (PBL), pp. 444–455.
- ICFP-2006-Abadi #calculus #data access #dependence
- Access control in a core calculus of dependency (MA), pp. 263–273.
- ICFP-2006-WalkerMLRA #static typing #type system #λ-calculus
- Static typing for a faulty λ calculus (DW, LWM, JL, GAR, DIA), pp. 38–49.
- ICPR-v1-2006-LamY #algorithm #calculus #clustering
- Improved Clustering Algorithm Based on Calculus of Variation (BSYL, HY), pp. 900–903.
- KR-2006-SannerM #calculus #first-order #hybrid #logic #reasoning
- An Ordered Theory Resolution Calculus for Hybrid Reasoning in First-Order Extensions of Description Logic (SS, SAM), pp. 100–111.
- KR-2006-ThielscherW #calculus #semantics
- The Features-and-Fluents Semantics for the Fluent Calculus (MT, TW), pp. 362–370.
- QAPL-2005-McIverM06 #calculus #game studies #novel #probability #μ-calculus
- A Novel Stochastic Game Via the Quantitative μ-calculus (AM, CM), pp. 195–212.
- PPDP-2006-BundgaardS #graph #π-calculus
- Typed polyadic π-calculus in bigraphs (MB, VS), pp. 1–12.
- PPDP-2006-FernandezF #calculus #functional #object-oriented
- A historic functional and object-oriented calculus (MF, FF), pp. 145–156.
- QAPL-2006-VigliottiH #calculus #probability
- Stochastic Ambient Calculus (MGV, PGH), pp. 169–186.
- POPL-2006-AlurCM #calculus #fixpoint
- A fixpoint calculus for local and global program flows (RA, SC, PM), pp. 153–165.
- POPL-2006-ErnstOC #calculus
- A virtual class calculus (EE, KO, WRC), pp. 270–282.
- SAC-2006-Lecca #algorithm #probability #π-calculus
- A time-dependent extension of gillespie algorithm for biochemical stochastic π-calculus (PL), pp. 137–144.
- CSL-2006-LengrandDM #calculus #type system
- A Sequent Calculus for Type Theory (SL, RD, JM), pp. 441–455.
- CSL-2006-ScheweF #calculus #finite #satisfiability #μ-calculus
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus (SS, BF), pp. 591–605.
FATES-RV-2006-FalconeFMR #calculus #framework #network #policy #security- A Test Calculus Framework Applied to Network Security Policies (YF, JCF, LM, JLR), pp. 55–69.
- IJCAR-2006-DyckhoffKL #bound #calculus #logic
- Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic (RD, DK, SL), pp. 347–361.
- IJCAR-2006-Walukiewicz-ChrzaszczC #calculus #consistency
- Consistency and Completeness of Rewriting in the Calculus of Constructions (DWC, JC), pp. 619–631.
- LICS-2006-Lassen #bisimulation #normalisation #λ-calculus #μ-calculus
- Head Normal Form Bisimulation for Pairs and the λμ-Calculus (SBL), pp. 297–306.
- LICS-2006-ManzonettoS #algebra #λ-calculus
- Boolean Algebras for λ Calculus (GM, AS), pp. 317–326.
- LICS-2006-PalamidessiSVV #on the #persistent #π-calculus
- On the Expressiveness of Linearity vs Persistence in the Asychronous π-Calculus (CP, VAS, FDV, BV), pp. 59–68.
- RTA-2006-ArbiserMR #λ-calculus
- A λ-Calculus with Constructors (AA, AM, AR), pp. 181–196.
- RTA-2006-OhtaH #confluence #linear #λ-calculus
- A Terminating and Confluent Linear λ Calculus (YO, MH), pp. 166–180.
- RTA-2006-Salvati #equation #linear #type system #λ-calculus
- Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus (SS), pp. 151–165.
SAT-2006-BonetLM #calculus #satisfiability- A Complete Calculus for Max-SAT (MLB, JL, FM), pp. 240–251.
- VMCAI-2006-KobayashiSW #analysis #resource management #π-calculus
- Resource Usage Analysis for the pi-Calculus (NK, KS, LW), pp. 298–312.
WICSA-2005-AliPRC #aspect-oriented #calculus #mobile- Introducing Ambient Calculus in Mobile Aspect-Oriented Software (NA, JP, IR, JÁC), pp. 233–234.
- WRLA-2004-CirsteaFK05 #calculus #constraints
- A rho-Calculus of Explicit Constraint Application (HC, GF, CK), pp. 51–67.
- WRLA-2004-LiquoriW05 #calculus #polymorphism #type checking #type inference
- The Polymorphic Rewriting-calculus: [Type Checking vs. Type Inference] (LL, BW), pp. 89–111.
- WRLA-2004-Wang05 #calculus #maude #model checking #μ-calculus
- μ-Calculus Model Checking in Maude (BYW), pp. 135–152.
- ESOP-2005-KremerR #analysis #protocol #π-calculus
- Analysis of an Electronic Voting Protocol in the Applied π Calculus (SK, MR), pp. 186–200.
- FoSSaCS-2005-EdalatLP #calculus #difference #multi
- A Computational Model for Multi-variable Differential Calculus (AE, AL, DP), pp. 505–519.
- FoSSaCS-2005-JeffreyR #abstraction #polymorphism #π-calculus
- Full Abstraction for Polymorphic π-Calculus (AJ, JR), pp. 266–281.
- FoSSaCS-2005-Stark #algebra #modelling #π-calculus
- Free-Algebra Models for the π-Calculus (IS), pp. 155–169.
- ICALP-2005-BaldamusPV #encoding #π-calculus
- A Fully Abstract Encoding of the π-Calculus with Data Terms (MB, JP, BV), pp. 1202–1213.
- ICALP-2005-NicolaGP #calculus
- Basic Observables for a Calculus for Global Computing (RDN, DG, RP), pp. 1226–1238.
FM-2005-Bosnacki #abstraction #calculus #on the #μ-calculus- On Some Galois Connection Based Abstractions for the μ-Calculus (DB), pp. 366–381.
- IFM-2005-LamP #consistency #diagrams #sequence chart #statechart #using #π-calculus
- Consistency Checking of Sequence Diagrams and Statechart Diagrams Using the π-Calculus (VSWL, JAP), pp. 347–365.
- SEFM-2005-AnantharamanCH #calculus #process
- A Synchronous Process Calculus for Service Costs (SA, JC, GH), pp. 435–444.
IFL-2005-Mackie #encoding #interactive #λ-calculus- Encoding Strategies in the λ Calculus with Interaction Nets (IM), pp. 19–36.
- SEKE-2005-IzadiM #algorithm #calculus #model checking #performance #μ-calculus
- An Efficient Model Checking Algorithm for a Fragment of μ-Calculus (MI, AMR), pp. 392–395.
- QAPL-2004-HankinW05 #program analysis #λ-calculus
- λ-calculus and Quantitative Program Analysis: (Extended Abstract) (CH, HW), pp. 5–18.
- QAPL-2004-Lluch-LafuenteM05 #calculus #constraints
- Quantitative ?-calculus and CTL Based on Constraint Semirings (ALL, UM), pp. 37–59.
- PPDP-2005-Gabbay #calculus
- A new calculus of contexts (MG), pp. 94–105.
- SAC-2005-Guillen-ScholtenABB #calculus #coordination #mobile
- MoCha-pi, an exogenous coordination calculus based on mobile channels (JGS, FA, FSdB, MMB), pp. 436–442.
ESEC-FSE-2005-Barbosa #architecture #calculus #component #refinement- A refinement calculus for software components and architectures (MAB), pp. 377–380.
- CADE-2005-Autexier #calculus
- The CoRe Calculus (SA), pp. 84–98.
- CADE-2005-BaumgartnerT #calculus #evolution #similarity
- The Model Evolution Calculus with Equality (PB, CT), pp. 392–408.
- CSL-2005-BarrasG #calculus #induction #on the
- On the Role of Type Decorations in the Calculus of Inductive Constructions (BB, BG), pp. 151–166.
- CSL-2005-Blanqui #algebra #calculus #decidability
- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations (FB), pp. 135–150.
- CSL-2005-BradfieldDQ #calculus #μ-calculus
- Transfinite Extension of the μ-Calculus (JCB, JD, SQ), pp. 384–396.
- LICS-2005-CastagnaNV #calculus #semantics #type system
- Semantic Subtyping for the p-Calculus (GC, RDN, DV), pp. 92–101.
- LICS-2005-Saurin #λ-calculus #μ-calculus
- Separation with Streams in the λμ-calculus (AS), pp. 356–365.
- RTA-2005-Rocheteau #call-by #λ-calculus #μ-calculus
- λμ-Calculus and Duality: Call-by-Name and Call-by-Value (JR), pp. 204–218.
- RTA-2005-Simpson #linear #reduction #semantics #λ-calculus
- Reduction in a Linear λ-Calculus with Applications to Operational Semantics (AKS), pp. 219–234.
- RTA-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.
- TLCA-2005-CoppolaLR #call-by #logic #λ-calculus
- Elementary Affine Logic and the Call-by-Value λ Calculus (PC, UDL, SRDR), pp. 131–145.
- TLCA-2005-Coquand #theorem #λ-calculus
- Completeness Theorems and λ-Calculus (TC), pp. 1–9.
- TLCA-2005-DavidN #normalisation #proving #symmetry #λ-calculus #μ-calculus
- Arithmetical Proofs of Strong Normalization Results for the Symmetric λμ-Calculus (RD, KN), pp. 162–178.
- TLCA-2005-Hermant #calculus #semantics
- Semantic Cut Elimination in the Intuitionistic Sequent Calculus (OH), pp. 221–233.
- TLCA-2005-SchurmannPS #calculus #encoding #functional #higher-order #programming
- The [triangle]-Calculus. Functional Programming with Higher-Order Encodings (CS, AP, JS), pp. 339–353.
- TLCA-2005-SelingerV #quantum #λ-calculus
- A λ Calculus for Quantum Computation with Classical Control (PS, BV), pp. 354–368.
- TLCA-2005-SeveriV #λ-calculus
- Continuity and Discontinuity in λ Calculus (PS, FJdV), pp. 369–385.
- VMCAI-2005-GrumbergLLS #calculus
- Don’t Know in the µ-Calculus (OG, ML, ML, SS), pp. 233–249.
- VMCAI-2005-Lange #automaton #calculus #linear
- Weak Automata for the Linear Time µ-Calculus (ML), pp. 267–281.
- ASE-2004-SpanoudakisM #calculus #framework #monitoring #requirements #towards
- Requirements Monitoring for Service-Based Systems: Towards a framework based on Event Calculus (GS, KM), pp. 379–384.
- ESOP-2004-AbadiBF #performance #π-calculus
- Just Fast Keying in the π Calculus (MA, BB, CF), pp. 340–354.
- ESOP-2004-LhoussaineS #calculus
- A Dependently Typed Ambient Calculus (CL, VS), pp. 171–187.
- FoSSaCS-2004-BaillotM #polynomial #λ-calculus
- Soft λ-Calculus: A Language for Polynomial Time Computation (PB, VM), pp. 27–41.
- FoSSaCS-2004-Caires #behaviour #logic #π-calculus
- Behavioral and Spatial Observations in a Logic for the π-Calculus (LC), pp. 72–89.
- FoSSaCS-2004-Polonovski #calculus #normalisation #μ-calculus
- Strong Normalization of λμμ-Calculus with Explicit Substitutions (EP), pp. 423–437.
- FoSSaCS-2004-WischikG #bisimulation #calculus
- Strong Bisimulation for the Explicit Fusion Calculus (LW, PG), pp. 484–498.
- FoSSaCS-2004-ZuninoD #calculus #encryption #process
- A Note on the Perfect Encryption Assumption in a Process Calculus (RZ, PD), pp. 514–528.
- FLOPS-2004-Kikuchi #calculus #normalisation #proving
- A Direct Proof of Strong Normalization for an Extended Herbelin?s Calculus (KK), pp. 244–259.
- ICALP-2004-Atkey #λ-calculus
- A λ-Calculus for Resource Separation (RA), pp. 158–170.
- ICALP-2004-Laird #calculus
- A Calculus of Coroutines (JL), pp. 882–893.
- ICALP-2004-Soltys #calculus #permutation
- LA, Permutations, and the Hajós Calculus (MS), pp. 1176–1187.
- KR-2004-CondottaL #axiom #calculus
- Axiomatizing the Cyclic Interval Calculus (JFC, GL), pp. 95–105.
- KR-2004-DeneckerT #calculus #induction
- Inductive Situation Calculus (MD, ET), pp. 545–553.
- KR-2004-MartinNT #calculus
- Knowledge of Other Agents and Communicative Actions in the Fluent Calculus (YM, IN, MT), pp. 623–633.
- GPCE-2004-AnconaM #calculus
- A Fresh Calculus for Name Management (DA, EM), pp. 206–224.
- PPDP-2004-LiquoriS #calculus #imperative #named
- iRho: an imperative rewriting calculus (LL, BPS), pp. 167–178.
- PPDP-2004-Lopez-FraguasRV #calculus #constraints #declarative #lazy evaluation #programming
- A lazy narrowing calculus for declarative constraint programming (FJLF, MRA, RdVV), pp. 43–54.
- POPL-2004-BalatCF #normalisation #partial evaluation #λ-calculus
- Extensional normalisation and type-directed partial evaluation for typed λ calculus with sums (VB, RDC, MPF), pp. 64–76.
- SAC-2004-BettiniBL #calculus #higher-order #mixin
- A core calculus of higher-order mixins and classes (LB, VB, SL), pp. 1508–1509.
- SAC-2004-FagorziZA #calculus #modelling #multi
- Modeling multiple class loaders by a calculus for dynamic linking (SF, EZ, DA), pp. 1281–1288.
- SAC-2004-LeccaPLC #predict #probability #π-calculus
- Predicting cell adhesion probability via the biochemical stochastic π-calculus (PL, CP, CL, GC), pp. 211–212.
- CSL-2004-AvelloneFFM #calculus #implementation #logic #performance
- A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation (AA, CF, GF, UM), pp. 488–502.
- CSL-2004-GrooteS #higher-order #linear #λ-calculus
- Higher-Order Matching in the Linear λ-calculus with Pairing (PdG, SS), pp. 220–234.
- CSL-2004-Hyland #abstract interpretation #calculus #proving
- Abstract Interpretation of Proofs: Classical Propositional Calculus (MH), pp. 6–21.
- CSL-2004-Schroder #logic #similarity #λ-calculus
- The Logic of the Partial λ-Calculus with Equality (LS), pp. 385–399.
- ICLP-2004-KundajiS #calculus #development #refinement #semantics
- Development of Semantic Debuggers Based on Refinement Calculus (RNK, RKS), pp. 460–461.
- IJCAR-2004-Farmer #calculus #formal method
- Formalizing Undefinedness Arising in Calculus (WMF), pp. 475–489.
- LICS-2004-AbramskyGMOS #abstraction #calculus #game studies
- Nominal Games and Full Abstraction for the Nu-Calculus (SA, DRG, ASM, CHLO, IDBS), pp. 150–159.
- LICS-2004-BaillotT #polynomial #λ-calculus
- Light Types for Polynomial Time Computation in λ-Calculus (PB, KT), pp. 266–275.
- LICS-2004-BaldamusPV #π-calculus
- Sπ Calculus Translated to ?--Calculus Preserving May-Tests (MB, JP, BV), pp. 22–31.
- LICS-2004-BucciarelliS #graph #λ-calculus
- The Sensible Graph Theories of λ Calculus (AB, AS), pp. 276–285.
- LICS-2004-GabbayC #calculus #logic
- A Sequent Calculus for Nominal Logic (MG, JC), pp. 139–148.
- LICS-2004-IntrigilaS #calculus
- The ω-Rule is Π⁰₂-Hard in the λβ-Calculus (BI, RS), pp. 202–210.
- LICS-2004-VIICHP #distributed #symmetry #λ-calculus
- A Symmetric Modal λ Calculus for Distributed Computing (TMV, KC, RH, FP), pp. 286–295.
- RTA-2004-JonesB #analysis #calculus #termination
- Termination Analysis of the Untyped lamba-Calculus (NDJ, NB), pp. 1–23.
- ESOP-2003-Lhoussaine #distributed #type inference #π-calculus
- Type Inference for a Distributed π-Calculus (CL), pp. 253–268.
- FoSSaCS-2003-ArnoldS #ambiguity #calculus #game studies #μ-calculus
- Ambiguous Classes in the Games μ-Calculus Hierarchy (AA, LS), pp. 70–86.
- FoSSaCS-2003-BergerHY #π-calculus
- Genericity and the π-Calculus (MB, KH, NY), pp. 103–119.
- FoSSaCS-2003-SprengerD #calculus #induction #on the #proving #reasoning #μ-calculus
- On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μ-Calculus (CS, MD), pp. 425–440.
- TACAS-2003-HenzingerKM #calculus #on the #μ-calculus
- On the Universal and Existential Fragments of the μ-Calculus (TAH, OK, RM), pp. 49–64.
- ECOOP-2003-JagadeesanJR #aspect-oriented #calculus #source code
- A Calculus of Untyped Aspect-Oriented Programs (RJ, AJ, JR), pp. 54–73.
- PPDP-2003-Virseda #calculus
- A demand-driven narrowing calculus with overlapping definitional trees (RdVV), pp. 253–263.
- POPL-2003-Chen #calculus #type system
- Coercive subtyping for the calculus of constructions (GC), pp. 150–159.
- POPL-2003-SchmittS #calculus #distributed #higher-order #process
- The m-calculus: a higher-order distributed process calculus (AS, JBS), pp. 50–61.
- CADE-2003-BaumgartnerT #calculus #evolution
- The Model Evolution Calculus (PB, CT), pp. 350–364.
- CAV-2003-Obdrzalek #bound #calculus #model checking #performance #μ-calculus
- Fast μ-Calculus Model Checking when Tree-Width Is Bounded (JO), pp. 80–92.
- CSL-2003-DavidG #normalisation #λ-calculus
- Strong Normalization of the Typed λws-Calculus (RD, BG), pp. 155–168.
- CSL-2003-MoserZ #calculus #tutorial
- The Epsilon Calculus (Tutorial) (GM, RZ), p. 455.
- CSL-2003-Schroder #calculus #modelling
- Henkin Models of the Partial σ-Calculus (LS), pp. 498–512.
- RTA-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.
- TLCA-2003-Blanqui #algebra #calculus #induction
- Inductive Types in the Calculus of Algebraic Constructions (FB), pp. 46–59.
- TLCA-2003-Fujita #λ-calculus #μ-calculus
- A Sound and Complete CPS-Translation for λμ-Calculus (KeF), pp. 120–134.
- VMCAI-2003-YangRS #encoding #logic #mobile #model checking #process #using #π-calculus
- A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution (PY, CRR, SAS), pp. 116–131.
- ESOP-2002-Thiemann #calculus #dependence #prototype
- A Prototype Dependency Calculus (PT), pp. 228–242.
- FASE-2002-BradfieldFS #calculus #ocl #using #μ-calculus
- Enriching OCL Using Observational μ-Calculus (JCB, JKF, PS), pp. 203–217.
- FoSSaCS-2002-BorealeG #calculus #composition #on the #reasoning
- On Compositional Reasoning in the Sπ-calculus (MB, DG), pp. 67–81.
- FoSSaCS-2002-Santocanale #calculus #category theory #proving #semantics
- A Calculus of Circular Proofs and Its Categorical Semantics (LS), pp. 357–371.
- TACAS-2002-Mateescu #calculus #lts #model checking #μ-calculus
- Local Model-Checking of Modal μ-Calculus on Acyclic Labeled Transition Systems (RM), pp. 281–295.
- WRLA-2002-CirsteaKL #calculus
- Rewriting Calculus with(out) Types (HC, CK, LL), pp. 3–19.
- WRLA-2002-ThatiSM #execution #maude #semantics #specification #testing #π-calculus
- An Executable Specification of Asynchronous π-Calculus Semantics and May Testing in Maude 2.0 (PT, KS, NMO), pp. 261–281.
- FLOPS-2002-Hasegawa #continuation #linear #monad #λ-calculus
- Linearly Used Effects: Monadic and CPS Transformations into the Linear λ Calculus (MH), pp. 167–182.
- FLOPS-2002-SumiiB #calculus #functional #named
- VMλ: A Functional Calculus for Scientific Discovery (ES, HB), pp. 290–304.
- ICFP-2002-OhoriY #calculus
- An interoperable calculus for external object access (AO, KY), pp. 60–71.
- KR-2002-Amir #calculus
- Projection in Decomposed Situation Calculus (EA), pp. 315–326.
- KR-2002-MateusPP #calculus #probability
- Observations and the Probabilistic Situation Calculus (PM, AP, JP), pp. 327–340.
- KR-2002-McCarthy #calculus
- Actions and Other Events in Situation Calculus (JM0), pp. 615–628.
OOPSLA-2002-Pucella #calculus #formal method #towards- Towards a formalization for COM part i: the primitive calculus (RP), pp. 331–342.
- LOPSTR-2002-FernandezS #approach #calculus
- An Operational Approach to Program Extraction in the Calculus of Constructions (MF, PS), pp. 111–125.
- LOPSTR-2002-GutierrezR #calculus #type system #verification
- A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene (FG, BCR), pp. 17–31.
- PPDP-2002-Fiore #analysis #evaluation #normalisation #semantics #λ-calculus
- Semantic analysis of normalisation by evaluation for typed λ calculus (MPF), pp. 26–37.
- PPDP-2002-HiguchiO #bytecode #calculus #java
- Java bytecode as a typed term calculus (TH, AO), pp. 201–211.
- PPDP-2002-OstrovskyPT #calculus #higher-order #towards
- Towards a primitive higher order calculus of broadcasting systems (KO, KVSP, WT), pp. 2–13.
- POPL-2002-RamseyP #monad #probability #λ-calculus
- Stochastic λ calculus and monads of probability distributions (NR, AP), pp. 154–165.
- CADE-2002-KupfermanSV #calculus #complexity
- The Complexity of the Graded µ-Calculus (OK, US, MYV), pp. 423–437.
- CSL-2002-BerwangerGL #calculus #on the #μ-calculus
- On the Variable Hierarchy of the Modal μ-Calculus (DB, EG, GL), pp. 352–366.
- CSL-2002-Niwinski #calculus #game studies #μ-calculus
- μ-Calculus via Games (DN), pp. 27–43.
- LICS-2002-EdalatL #calculus #difference
- Domain Theory and Differential Calculus (Functions of one Variable) (AE, AL), pp. 277–286.
- LICS-2002-Statman #calculus #on the
- On The λ Y Calculus (RS), pp. 159–166.
- RTA-2002-FaureK #calculus #exception
- Exceptions in the Rewriting Calculus (GF, CK), pp. 66–82.
- RTA-2002-Forest #calculus #pattern matching
- A Weak Calculus with Explicit Operators for Pattern Matching and Substitution (JF), pp. 174–191.
- RTA-2002-KennawayKP #composition #static analysis #λ-calculus
- Static Analysis of Modularity of β-Reduction in the Hyperbalanced λ-Calculus (RK, ZK, AP), pp. 51–65.
- ESOP-2001-ConchonP #calculus #constraints #type inference
- JOIN(X): Constraint-Based Type Inference for the Join-Calculus (SC, FP), pp. 221–236.
- ESOP-2001-Mitchell #analysis #calculus #polynomial #probability #process #protocol #security
- Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis (JCM), pp. 23–29.
- FASE-2001-ClarkEK #calculus #metamodelling #semantics #uml
- The Metamodelling Language Calculus: Foundation Semantics for UML (TC, AE, SK), pp. 17–31.
- FASE-2001-ReusWH #calculus #design #hoare #java #modelling #ocl #verification
- A Hoare Calculus for Verifying Java Realizations of OCL-Constrained Design Models (BR, MW, RH), pp. 300–317.
- FoSSaCS-2001-BuscemiS #calculus #petri net
- High-Level Petri Nets as Type Theories in the Join Calculus (MGB, VS), pp. 104–120.
- FoSSaCS-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.
- TACAS-2001-BolligLW #calculus #model checking #parallel #μ-calculus
- Parallel Model Checking for the Alternation Free μ-Calculus (BB, ML, MW), pp. 543–558.
- SAS-2001-RajamaniR #behaviour #π-calculus
- A Behavioral Module System for the π-Calculus (SKR, JR), pp. 375–394.
- FLOPS-2001-Hortala-GonzalezU #automaton #calculus #lazy evaluation
- An Abstract Machine Based System for a Lazy Narrowing Calculus (MTHG, EU), pp. 216–232.
- FLOPS-2001-SatoSK #calculus
- A Simply Typed Context Calculus with First-Class Environments (MS, TS, YK), pp. 359–374.
- OOPSLA-2001-AnconaLZ #calculus #exception #java
- A Core Calculus for Java Exceptions (DA, GL, EZ), pp. 16–30.
- PPDP-2001-HepburnW #trust #π-calculus
- Trust in the π-Calculus (MH, DW), pp. 103–114.
PADL-2001-Ramakrishnan #calculus #logic programming #model checking #using #μ-calculus- A Model Checker for Value-Passing μ-Calculus Using Logic Programming (CRR), pp. 1–13.
- POPL-2001-Calcagno #calculus #correctness #safety #semantics
- Stratified operational semantics for safety and correctness of the region calculus (CC), pp. 155–165.
- POPL-2001-IgarashiK #type system #π-calculus
- A generic type system for the π-calculus (AI, NK), pp. 128–141.
- POPL-2001-Vouillon #calculus
- Combining subsumption and binary methods: an object calculus with views (JV), pp. 290–303.
- SAC-2001-FerrariT #calculus #debugging #mobile
- A debugging calculus for mobile ambients (GLF, ET).
- CAV-2001-GrumbergHS #calculus #distributed #model checking #μ-calculus
- Distributed Symbolic Model Checking for μ-Calculus (OG, TH, AS), pp. 350–362.
- CSL-2001-AbramskyL #modelling #λ-calculus
- Fully Complete Minimal PER Models for the Simply Typed λ-Calculus (SA, ML), pp. 443–457.
- CSL-2001-GuglielmiS #calculus #commutative
- Non-commutativity and MELL in the Calculus of Structures (AG, LS), pp. 54–68.
- IJCAR-2001-BeckertS #calculus #first-order #logic
- A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities (BB, SS), pp. 626–641.
- IJCAR-2001-LetzS #calculus #named #proving #theorem proving
- DCTP — A Disconnection Calculus Theorem Prover — System Abstract (RL, GS), pp. 381–385.
- IJCAR-2001-SattlerV #calculus #hybrid
- The Hybrid µ-Calculus (US, MYV), pp. 76–91.
- LICS-2001-AltenkirchDHS #evaluation #normalisation #λ-calculus
- Normalization by Evaluation for Typed λ Calculus with Coproducts (TA, PD, MH, PJS), pp. 303–310.
- LICS-2001-Blanqui #calculus
- Definitions by Rewriting in the Calculus of Constructions (FB), pp. 9–18.
- LICS-2001-JaninL #calculus #monad #μ-calculus
- Relating Levels of the μ-Calculus Hierarchy and Levels of the Monadic Hierarchy (DJ, GL), pp. 347–356.
- LICS-2001-MitchellRST #analysis #calculus #probability #process #protocol #security
- Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis (JCM, AR, AS, VT), pp. 3–5.
- LICS-2001-Salibra #semantics #λ-calculus
- A Continuum of Theories of λ Calculus without Semantics (AS), pp. 334–343.
- LICS-2001-Terui #calculus #normalisation
- Light Affine Calculus and Polytime Strong Normalization (KT), pp. 209–220.
- LICS-2001-YoshidaBH #normalisation #π-calculus
- Strong Normalisation in the π-Calculus (NY, MB, KH), pp. 311–322.
- RTA-2001-VestergaardB #confluence #first-order #proving #using #λ-calculus
- A Formalised First-Order Confluence Proof for the λ-Calculus Using One-Sorted Variable Names (RV, JB), pp. 306–321.
- TLCA-2001-AltenkirchC #polymorphism #λ-calculus
- A Finitary Subsystem of the Polymorphic λ-Calculus (TA, TC), pp. 22–28.
- TLCA-2001-BergerHY #π-calculus
- Sequentiality and the π-Calculus (MB, KH, NY), pp. 29–45.
- TLCA-2001-Filinski #evaluation #normalisation #λ-calculus
- Normalization by Evaluation for the Computational λ-Calculus (AF), pp. 151–165.
- TLCA-2001-Gianantonio #game studies #lazy evaluation #semantics #λ-calculus
- Game Semantics for the Pure Lazy λ-calculus (PDG), pp. 106–120.
- TLCA-2001-Jay #calculus #data type
- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types (CBJ), pp. 217–239.
- TLCA-2001-Joly #λ-calculus
- The Finitely Generated Types of the λ-Calculus (TJ), pp. 240–252.
- TLCA-2001-Matthes #higher-order #induction #λ-calculus #μ-calculus
- Parigot’s Second Order λμ-Calculus and Inductive Types (RM), pp. 329–343.
- TLCA-2001-Miquel #calculus
- The Implicit Calculus of Constructions (AM), pp. 344–359.
- TLCA-2001-Pinto #geometry #implementation #interactive #modelling #parallel #using #λ-calculus
- Parallel Implementation Models for the λ-Calculus Using the Geometry of Interaction (JSP), pp. 385–399.
- ESOP-2000-FisherRR #calculus #compilation
- A Calculus for Compiling and Linking Classes (KF, JHR, JGR), pp. 135–149.
- ESOP-2000-MachkasovaT #calculus #compilation
- A Calculus for Link-Time Compilation (EM, FAT), pp. 260–274.
- FoSSaCS-2000-BartheR #calculus #induction #type system
- Constructor Subtyping in the Calculus of Inductive Constructions (GB, FvR), pp. 17–34.
- FoSSaCS-2000-HerescuP #probability #π-calculus
- Probabilistic Asynchronous π-Calculus (OMH, CP), pp. 146–160.
- FoSSaCS-2000-HonsellLST #refinement #λ-calculus
- Constructive Data Refinement in Typed λ Calculus (FH, JL, DS, AT), pp. 161–176.
- WRLA-2000-CirsteaK #calculus
- The simply typed rewriting calculus (HC, CK), pp. 24–42.
- WRLA-2000-Stehr #calculus #named
- CINNI — A Generic Calculus of Explicit Substitutions and its Application to λ-, ς- and pi- Calculi (MOS), pp. 70–92.
- STOC-2000-AlekhnovichBRW #calculus #complexity
- Space complexity in propositional calculus (MA, EBS, AAR, AW), pp. 358–367.
- ICALP-2000-Buresh-OppenheimCIP #calculus
- Homogenization and the Polynominal Calculus (JBO, MC, RI, TP), pp. 926–937.
- ICALP-2000-HennessyR #data flow #resource management #π-calculus
- Information Flow vs. Resource Access in the Asynchronous π-Calculus (MH, JR), pp. 415–427.
- KR-2000-ShapiroPLL #calculus
- Iterated Belief Change in the Situation Calculus (SS, MP, YL, HJL), pp. 527–538.
- TOOLS-EUROPE-2000-CanalFTV #calculus #corba #interface #protocol
- Extending CORBA Interfaces with p-Calculus for Protocol Compatibility (CC, LF, JMT, AV), pp. 208–225.
- PPDP-2000-Faggian #calculus #clustering #commutative #proving
- Proof construction and non-commutativity: a cluster calculus (CF), pp. 80–91.
- PPDP-2000-PediciniQ #implementation #parallel #reduction #λ-calculus
- A parallel implementation for optimal λ-calculus reduction (MP, FQ), pp. 3–14.
- CADE-2000-Gillard #calculus #concurrent #formal method
- A Formalization of a Concurrent Object Calculus up to alpha-Conversion (GG), pp. 417–432.
- CL-2000-ArenasBK #calculus #consistency #database #query
- Applications of Annotated Predicate Calculus to Querying Inconsistent Databases (MA, LEB, MK), pp. 926–941.
- CL-2000-HolldoblerS #calculus #diagrams #problem #using
- Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams (SH, HPS), pp. 747–761.
- CL-2000-LehmannL #calculus #decidability
- Decidability Results for the Propositional Fluent Calculus (HL, ML), pp. 762–776.
- CL-2000-StorrT #calculus #equation
- A New Equational Foundation for the Fluent Calculus (HPS, MT), pp. 733–746.
- CSL-2000-Naijun #calculus #higher-order
- Completeness of Higher-Order Duration Calculus (ZN), pp. 442–456.
- LICS-2000-Prost #calculus #dependence
- A Static Calculus of Dependencies for the λ-Cube (FP), pp. 267–276.
- RTA-2000-JoachimskiM #confluence #standard #λ-calculus
- Standardization and Confluence for a λ Calculus with Generalized Applications (FJ, RM), pp. 141–155.
- FoSSaCS-1999-Boer #calculus #object-oriented
- A WP-calculus for OO (FSdB), pp. 135–149.
- FoSSaCS-1999-NarasimhaCI #calculus #logic #probability #μ-calculus
- Probabilistic Temporal Logics via the Modal μ-Calculus (MN, RC, SPI), pp. 288–305.
- FoSSaCS-1999-RocklS #algol #concurrent #process #semantics #π-calculus
- A π-calculus Process Semantics of Concurrent Idealised ALGOL (CR, DS), pp. 306–321.
- TACAS-1999-MontanariP #finite #verification #π-calculus
- Finite State Verification for the Asynchronous π-Calculus (UM, MP), pp. 255–269.
- PEPM-1999-Mogensen #λ-calculus
- Gödelization in the Untyped λ-Calculus (TÆM), pp. 19–24.
- STOC-1999-BussGIP #calculus #linear #polynomial
- Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (SRB, DG, RI, TP), pp. 547–556.
- ICALP-1999-Miculan #calculus #formal method #induction #lazy evaluation #proving #μ-calculus
- Formalizing a Lazy Substitution Proof System for μ-calculus in the Calculus of Inductive Constructions (MM), pp. 554–564.
- FM-v1-1999-Rouzaud #calculus #refinement
- Interpreting the B-Method in the Refinement Calculus (YR), pp. 411–430.
- FM-v2-1999-Feijs #modelling #using #π-calculus
- Modelling Microsoft COM Using π-Calculus (LMGF), pp. 1343–1363.
- FM-v2-1999-SmarandacheGG #calculus #constraints #realtime #validation
- Validation of Mixed SIGNAL-ALPHA Real-Time Systems through Affine Calculus on Clock Synchronisation Constraints (IMS, TG, PLG), pp. 1364–1383.
- IFM-1999-StoddartD #calculus #modelling #refinement
- The Refinement of Event Calculus Models (BS, SD), pp. 151–169.
- ECOOP-1999-BonoPS #calculus #mixin
- A Core Calculus of Classes and Mixins (VB, AP, VS), pp. 43–66.
- OOPSLA-1999-IgarashiPW #calculus #java
- Featherweight Java: A Minimal Core Calculus for Java and GJ (AI, BCP, PW), pp. 132–146.
- TOOLS-ASIA-1999-WangLPZZ #approach #calculus #development #formal method #refinement
- A Formal Software Development Approach Based on COOZ and Refinement Calculus (YW, BL, JP, MZ, GZ), pp. 261–266.
- PPDP-1999-AnconaZ #calculus
- A Primitive Calculus for Module Systems (DA, EZ), pp. 62–79.
- PPDP-1999-FernandezM #calculus #interactive
- A Calculus for Interaction Nets (MF, IM), pp. 170–187.
- PPDP-1999-LopesSV #calculus #process #virtual machine
- A Virtual Machine for a Process Calculus (LMBL, FMAS, VTV), pp. 244–260.
- POPL-1999-AbadiBHR #calculus #dependence
- A Core Calculus of Dependency (MA, AB, NH, JGR), pp. 147–160.
- POPL-1999-CraryWM #calculus #memory management
- Typed Memory Management in a Calculus of Capabilities (KC, DW, JGM), pp. 262–275.
- CADE-1999-BaumgartnerEF #calculus #confluence
- A Confluent Connection Calculus (PB, NE, UF), pp. 329–343.
- CSL-1999-FernandezM #reduction #λ-calculus
- Closed Reductions in the λ-Calculus (MF, IM), pp. 220–234.
- CSL-1999-IshtiaqP #modelling #λ-calculus
- Kripke Resource Models of a Dependently-Typed, Bunched λ-Calculus (SSI, DJP), pp. 235–249.
- LICS-1999-BanerjeeHR #analysis #polymorphism #λ-calculus
- Region Analysis and the Polymorphic λ Calculus (AB, NH, JGR), pp. 88–97.
- LICS-1999-BruniM #category theory #π-calculus
- Cartesian Closed Double Categories, Their λ-Notation, and the π-Calculus (RB, UM), pp. 246–265.
- LICS-1999-DrossopoulouEW #calculus #compilation #towards
- A Fragment Calculus — Towards a Model of Separate Compilation, Linking and Binary Compatibility (SD, SE, DW), pp. 147–156.
- RTA-1999-BlanquiJO #algebra #calculus
- The Calculus of algebraic Constructions (FB, JPJ, MO), pp. 301–316.
- TLCA-1999-Fujita #call-by #morphism #polymorphism #λ-calculus #μ-calculus
- Explicitly Typed λμ-Calculus for Polymorphism an Call-by-Value (KeF), pp. 162–176.
- TLCA-1999-GianantonioFH #game studies #semantics #λ-calculus
- Game Semantics for Untyped λβη-Calculus (PDG, GF, FH), pp. 114–128.
- TLCA-1999-OHearn #λ-calculus
- Resource Interpretations, Bunched Implications and the αλ-Calculus (PWO), pp. 258–279.
- FASE-1998-Scholz #calculus #refinement
- A Refinement Calculus for Statecharts (PS), pp. 285–301.
- TACAS-1998-Sprenger #calculus #coq #model checking #μ-calculus
- A Verified Model Checker for the Modal μ-calculus in Coq (CS), pp. 167–183.
- WRLA-1998-Jouannaud #calculus #equation #induction #logic
- Membership equational logic, calculus of inductive instructions, and rewrite logic (JPJ), pp. 388–393.
- WRLA-1998-Viry #calculus #equation
- Adventures in sequent calculus modulo equations (PV), pp. 21–32.
- ICALP-1998-LiC #bisimulation #congruence #π-calculus
- Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the π-Calculus (ZL, HC), pp. 707–718.
- ICALP-1998-Lin #proving #π-calculus
- Complete Proof Systems for Observation Congruences in Finite-Control π-Calculus (HL), pp. 443–454.
- ICALP-1998-Sewell #distributed #type system #π-calculus
- Global/Local Subtyping and Capability Inference for a Distributed π-calculus (PS), pp. 695–706.
- ICALP-1998-VictorP #calculus #concurrent #constraints
- Concurrent Constraints in the Fusion Calculus (BV, JP), pp. 455–469.
- ICFP-1998-Faggian #approach #calculus
- A Term Calculus for Unitary Approach to Nomalization (CF), p. 347.
- ICFP-1998-KutznerS #call-by #nondeterminism #λ-calculus
- A Non-Deterministic Call-by-Need λ Calculus (AK, MSS), pp. 324–335.
- KR-1998-Lifschitz #calculus #logic
- Situation Calculus and Causal Logic (VL), pp. 536–546.
- KR-1998-Renz #calculus #canonical
- A Canonical Model of the Region Connection Calculus (JR), pp. 330–341.
- ECOOP-1998-BonoF #calculus #first-order #imperative
- An Imperative, First-Order Calculus with Object Extension (VB, KF), pp. 462–497.
- OOPSLA-1998-GianantonioHL #self #λ-calculus
- A λ Calculus of Objects with Self-Inflicted Extension (PDG, FH, LL), pp. 166–178.
- POPL-1998-AriolaS #calculus #call-by #correctness #imperative #monad
- Correctness of Monadic State: An Imperative Call-by-Need Calculus (ZMA, AS), pp. 62–74.
- POPL-1998-HeintzeR #calculus #programming
- The SLam Calculus: Programming with Secrecy and Integrity (NH, JGR), pp. 365–377.
- CADE-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.
- JICSLP-1998-Milner #π-calculus
- The π Calculus and Its Applications (Keynote Address) (RM), pp. 3–4.
- LICS-1998-CharatonikMNPW #calculus #μ-calculus
- The Horn μ-calculus (WC, DAM, DN, AP, IW), pp. 58–69.
- LICS-1998-FriasM #calculus #relational
- Completeness of a Relational Calculus for Program Schemes (MFF, RDM), pp. 127–134.
- LICS-1998-ParrowV #calculus #mobile #process #symmetry
- The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes (JP, BV), pp. 176–185.
- LICS-1998-PavlovicE #calculus #induction
- Calculus in Coinductive Form (DP, MHE), pp. 408–417.
- PEPM-1997-AsaiMY #call-by #partial evaluation #λ-calculus
- Partial Evaluation of Call-by-Value λ-Calculus with Side-Effects (KA, HM, AY), pp. 12–21.
- PEPM-1997-GenglerM #partial evaluation #self #π-calculus
- Self-Applicable Partial Evaluation for the π-Calculus (MG, MM), pp. 36–46.
- STOC-1997-RazborovWY #branch #calculus #proving #source code
- Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus (AAR, AW, ACCY), pp. 739–748.
- ICALP-1997-BurkartS #calculus #infinity #model checking #process #μ-calculus
- Model Checking the Full Modal μ-Calculus for Infinite Sequential Processes (OB, BS), pp. 419–429.
- ICALP-1997-PhilippouW #confluence #on the #π-calculus
- On Confluence in the π-Calculus (AP, DW), pp. 314–324.
- CAiSE-1997-DiazP #calculus #modelling #policy #validation
- Stimuli and Business Policies as Modelling Constructs: Their Definition and Validation Through the Event Calculus (OD, NWP), pp. 33–46.
- TOOLS-PACIFIC-1997-ZhangP #calculus #modelling
- Class-Based Models in the -Calculus (XZ, JP), pp. 238–251.
- ALP-1997-BartheKR #λ-calculus
- Explicit Substitutions for the λ-Calculus (GB, FK, AR), pp. 209–223.
- ALP-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.
- PLILP-1997-CompagnoniF #algebra #calculus #on the
- On Object Calculus with Algebraic Rewriting (ABC, MF), pp. 17–31.
- POPL-1997-Boudol #π-calculus
- The π-calculus in Direct Style (GB), pp. 228–241.
- POPL-1997-Palamidessi #power of #π-calculus
- Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus (CP), pp. 256–265.
- POPL-1997-PierceS #behaviour #equivalence #polymorphism #π-calculus
- Behavioral Equivalence in the Polymorphic π-calculus (BCP, DS), pp. 242–255.
- CADE-1997-HutterK #λ-calculus
- A Colored Version of the Lambda-Calculus (DH, MK), pp. 291–305.
- CADE-1997-RousselM #calculus #compilation
- Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case (OR, PM), pp. 161–175.
- CAV-1997-Biere #calculus #model checking #named #performance #μ-calculus
- μcke — Efficient μ-Calculus Model Checking (AB), pp. 468–471.
- CAV-1997-PardoH #abstraction #automation #calculus #model checking #μ-calculus
- Automatic Abstraction Techniques for Propositional μ-calculus Model Checking (AP, GDH), pp. 12–23.
- CSL-1997-BonattiO #calculus
- A Sequent Calculus for Circumscription (PAB, NO), pp. 98–114.
- CSL-1997-Hofmann #linear #recursion #λ-calculus
- A Mixed Modal/Linear λ Calculus with Applications to Bellantoni-Cook Safe Recursion (MH0), pp. 275–294.
- CSL-1997-Moschovakis #concurrent #game studies #recursion #λ-calculus
- A Game-Theoretic, Concurrent and Fair Model of the Typed λ-calculus, with Full Recursion (YNM), pp. 341–359.
- ICLP-1997-Mahajan #concurrent #logic programming #π-calculus
- Concurrent Logic Programming and π Calculus (SM, SR), p. 411.
- ILPS-1997-Arenas-SanchezR #algebra #calculus #functional #lazy evaluation #logic programming #polymorphism
- A Lazy Narrowing Calculus for Functional Logic Programming with Algebraic Polymorphic Types (PAS, MRA), pp. 53–67.
- LICS-1997-HofmannS #continuation #modelling #λ-calculus #μ-calculus
- Continuation Models are Universal for λμ-Calculus (MH, TS), pp. 387–395.
- LICS-1997-Kobayashi #calculus #concurrent #process
- A Partially Deadlock-Free Typed Process Calculus (NK0), pp. 128–139.
- TLCA-1997-BonoB #constraints #λ-calculus
- Matching Constraints for the λ Calculus of Objects (VB, MB), pp. 46–62.
- TLCA-1997-Courant #calculus #type system
- A Module Calculus for Pure Type Systems (JC), pp. 112–128.
- TLCA-1997-Ghani #calculus #dependent type #type system
- Eta-Expansions in Dependent Type Theory — The Calculus of Constructions (NG), pp. 164–180.
- TLCA-1997-Ruess #calculus #proving #theorem proving
- Computational Reflection in the Calculus of Constructions and its Application to Theorem Proving (HR), pp. 319–335.
- RWLW-1996-Lechner #calculus #distributed #maude #object-oriented #specification #μ-calculus
- Object-oriented specifications of distributed systems in the μ-Calculus and Maude (UL), pp. 385–404.
- TACAS-1996-BhatC #calculus #model checking #μ-calculus
- Efficent Local Model-Checking for Fragments of teh Modal μ-Calculus (GB, RC), pp. 107–126.
- TACAS-1996-Stirling #calculus #game studies #μ-calculus
- Games and Modal μ-Calculus (CS), pp. 298–312.
- ICALP-1996-BradfieldEM #calculus #effectiveness #linear #μ-calculus
- An Effective Tableau System for the Linear Time μ-Calculus (JCB, JE, AM), pp. 98–109.
- ICALP-1996-Lenzi #calculus #theorem #μ-calculus
- A Hierarchy Theorem for the μ-Calculus (GL), pp. 87–97.
- ICALP-1996-Pin #automaton #calculus #first-order #power of
- The Expressive Power of Existential First Order Sentences of Büchi’s Sequential Calculus (JÉP), pp. 300–311.
- ICFP-1996-HardinMP #calculus #functional
- Functional Back-Ends within the λσ Calculus (TH, LM, BP), pp. 25–33.
- ICFP-1996-LawallM #cost analysis #question #what #λ-calculus
- Optimality and Inefficiency: What Isn’t a Cost Model of the λ Calculus? (JLL, HGM), pp. 92–101.
- ICFP-1996-LeeF #formal method #incremental #towards #λ-calculus
- Enriching the λ Calculus with Contexts: Toward a Theory of Incremental Program Construction (SDL, DPF), pp. 239–250.
- KR-1996-Giunchiglia #calculus
- Determining Ramifications in the Situation Calculus (EG), pp. 76–86.
- KR-1996-Kelley #calculus #case study #modelling #problem #using
- Modeling Complex Systems in the Situation Calculus: A Case Study Using the Dagstuhl Steam Boiler Problem (TGK), pp. 26–37.
- KR-1996-Lakemeyer #calculus
- Only Knowing in the Situation Calculus (GL), pp. 14–25.
- KR-1996-MillerS #calculus #reasoning
- Reasoning about Discontinuities in the Event Calculus (RM, MS), pp. 63–74.
- KR-1996-Reiter #calculus #concurrent
- Natural Actions, Concurrency and Continuous Time in the Situation Calculus (RR), pp. 2–13.
- POPL-1996-FournetG #calculus #reflexive
- The Reflexive CHAM and the Join-Calculus (CF, GG), pp. 372–385.
- POPL-1996-GordonR #calculus #first-order #similarity #type system
- Bisimilarity for a First-Order Calculus of Objects with Subtyping (ADG, GDR), pp. 386–395.
- POPL-1996-KobayashiPT #π-calculus
- Linearity and the π-Calculus (NK, BCP, DNT), pp. 358–371.
- CADE-1996-Felty #calculus #proving #set
- Proof Search with Set Variable Instantiation in the Calculus of Constructions (APF), pp. 658–672.
- CAV-1996-PistoreS #algorithm #refinement #π-calculus
- A Partition Refinement Algorithm for the π-Calculus (Extended Abstract) (MP, DS), pp. 38–49.
- CSL-1996-Roversi #resource management #λ-calculus
- A Type-Free Resource-Aware λ-Calculus (LR), pp. 399–413.
- JICSLP-1996-BugliesiDML #calculus #linear #logic
- A Linear Logic Calculus Objects (MB, GD, LL, MM), pp. 67–81.
- JICSLP-1996-DeneckerBDPS #calculus #empirical #information management #protocol #representation #specification
- A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification (MD, KVB, GD, FP, DDS), pp. 170–184.
- LICS-1996-BentonW #linear #logic #monad #λ-calculus
- Linear Logic, Monads and the λ Calculus (PNB, PW), pp. 420–431.
- LICS-1996-BhatC #calculus #equation #model checking #performance #μ-calculus
- Efficient Model Checking via the Equational μ-Calculus (GB, RC), pp. 304–312.
- LICS-1996-FioreMS #π-calculus
- A Fully-Abstract Model for the π-Calculus (Extended Abstract) (MPF, EM, DS), pp. 43–54.
- LICS-1996-Munoz #calculus #confluence #normalisation
- Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus (CAM), pp. 440–447.
- LICS-1996-Seidl #calculus #μ-calculus
- A Modal μ-Calculus for Durational Transition Systems (HS), pp. 128–137.
- LICS-1996-Stark #abstract domain #domain model #π-calculus
- A Fully Abstract Domain Model for the π-Calculus (IS), pp. 36–42.
- RTA-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.
SIGMOD-1995-FegarasM #calculus #effectiveness #query #towards- Towards an Effective Calculus for Object Query Languages (LF, DM), pp. 47–58.
- ESOP-J-1994-Prasad95 #calculus
- A Calculus of Broadcasting Systems (KVSP), pp. 285–327.
- TACAS-1995-Mader #calculus #model checking #μ-calculus
- Modal μ-Calculus, Model Checking and Gauß Elimination (AM), pp. 72–88.
- PEPM-1995-Mogensen #online #partial evaluation #self #λ-calculus
- Self-applicable Online Partial Evaluation of Pure λ Calculus (TÆM), pp. 39–44.
- SAS-1995-PalsbergO #trust #λ-calculus
- Trust in the λ-Calculus (JP, PØ), pp. 314–329.
- SAS-1995-Schmidt-SchausPS #calculus #reduction #using
- Abstract Reduction Using a Tableau Calculus (MSS, SEP, MS), pp. 348–365.
FPCA-1995-HylandO #game studies #π-calculus- π-Calculus, Dialogue Games and PCF (JMEH, CHLO), pp. 96–107.
- PLILP-1995-KamareddineR #λ-calculus
- A λ-calculus à la de Bruijn with Explicit Substitutions (FK, AR), pp. 45–62.
- PLILP-1995-NakaharaMI #calculus #functional #higher-order #logic programming
- A Complete Narrowing Calculus for Higher-Order Functional Logic Programming (KN, AM, TI), pp. 97–114.
- POPL-1995-AriolaFMOW #call-by #λ-calculus
- The Call-by-Need λ Calculus (ZMA, MF, JM, MO, PW), pp. 233–246.
ASF+SDF-1995-Deursen #π-calculus- A Simple π-Calculus Manipulation Tool (AvD), pp. 211–232.
- CAV-1995-BouajjaniLR #automaton #calculus #hybrid #linear
- From Duration Calculus To Linear Hybrid Automata (AB, YL, RR), pp. 196–210.
- CAV-1995-Emerson #calculus #model checking #tutorial #μ-calculus
- Methods for μ-calculus Model Checking: A Tutorial (Abstract) (EAE), p. 141.
- CAV-1995-Rauzy #calculus #constraints #μ-calculus
- Toupie = μ-Calculus + Constraints (AR), pp. 114–126.
- ICLP-1995-BelleghemDS #calculus
- Combining Situation Calculus and Event Calculus (KVB, MD, DDS), pp. 83–97.
- ICLP-1995-CervesatoCM #calculus #framework #logic programming #order
- A Modal Calculus of Partially Ordered Events in a Logic Programming Framework (IC, LC, AM), pp. 299–313.
- ICLP-1995-Hirata #correctness #haskell #proving #π-calculus
- Proving Correctness of Translation from Moded Flat GHC to π-Calculus (KH), p. 818.
- ICLP-1995-SadriK #calculus
- Variants of the Event Calculus (FS, RAK), pp. 67–81.
- ICLP-1995-Sripada #calculus #database #implementation #performance
- Efficient Implementation of the Event Calculus for Temporal Database Applications (SMS), pp. 99–113.
- LICS-1995-AbramskyM #abstraction #game studies #lazy evaluation #λ-calculus
- Games and Full Abstraction for the Lazy λ-Calculus (SA, GM), pp. 234–243.
- LICS-1995-GayN #calculus #process
- A Typed Calculus of Synchronous Processes (SJG, RN), pp. 210–220.
- LICS-1995-Walukiewicz #axiom #calculus #μ-calculus
- Completeness of Kozen’s Axiomatisation of the Propositional μ-Calculus (IW), pp. 14–24.
- RTA-1995-Asperti #exclamation #implementation #optimisation #λ-calculus
- deltao!Epsilon = 1 — Optimizing Optimal λ-Calculus Implementations (AA), pp. 102–116.
- TLCA-1995-AspertiL #graph #λ-calculus
- Comparing λ-calculus translations in Sharing Graphs (AA, CL), pp. 1–15.
- TLCA-1995-Dowek #combinator #comprehension #λ-calculus
- λ-calculus, Combinators and the Comprehension Scheme (GD), pp. 154–170.
- TLCA-1995-Groote #calculus #exception
- A Simple Calculus of Exception Handling (PdG), pp. 201–215.
- TLCA-1995-Holmes #type system #λ-calculus
- Untyped λ-Calculus with Relative Typing (MRH), pp. 235–248.
- TLCA-1995-HonsellL #semantics #λ-calculus
- Final Semantics for untyped λ-calculus (FH, ML), pp. 249–265.
- TLCA-1995-PravatoRR #call-by #category theory #semantics #λ-calculus
- Categorical semantics of the call-by-value λ-calculus (AP, SRDR, LR), pp. 381–396.
- TLCA-1995-RitterP #ml #standard #λ-calculus
- A Fully Abstract Translation between a λ-Calculus with Reference Types and Standard ML (ER, AMP), pp. 397–413.
- TLCA-1995-Simpson #category theory #λ-calculus
- Categorical completeness results for the simply-typed λ-calculus (AKS), pp. 414–427.
PODS-1994-OhoriT #calculus #polymorphism- A Polymorphic Calculus for Views and Object Sharing (AO, KT), pp. 255–266.
- ESOP-1994-Boerio #higher-order #polymorphism #λ-calculus
- Extending Pruning Techniques to Polymorphic Second order λ-Calculus (LB), pp. 120–134.
- ESOP-1994-Li #prolog #specification #π-calculus
- A π-Calculus Specification of Prolog (BZL), pp. 379–393.
- ESOP-1994-Milner #named #visual notation #π-calculus
- Pi-Nets: A Graphical Form of π-Calculus (RM), pp. 26–42.
- PEPM-1994-CourtenageC #type inference #λ-calculus
- Analysing Resource Use in the λ Calculus by Type Inference (SC, CDC), pp. 33–41.
- SAS-1994-BanerjeeS #call-by #λ-calculus
- Stackability in the Simply-Typed Call-by-Value λ Calculus (AB, DAS), pp. 131–146.
LFP-1994-KfouryW #algorithm #higher-order #type inference #λ-calculus- A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order λ-Calculus (AJK, JBW), pp. 196–207.
- KR-1994-Schild #calculus
- Terminological Cycles and the Propositional µ-Calculus (KS), pp. 509–520.
- SEKE-1994-Sakalauskaite #branch #calculus #first-order #logic
- A complete sequent calculus for a first order branching temporal logic (JS), pp. 274–280.
- POPL-1994-GarrigueA #polymorphism #λ-calculus
- The Typed Polymorphic Label-Selective λ-Calculus (JG, HAK), pp. 35–47.
- POPL-1994-Muller #calculus #staging #verification
- A Staging Calculus and its Application to the Verification of Translators (RM), pp. 389–396.
- POPL-1994-TofteT #call-by #implementation #stack #using #λ-calculus
- Implementation of the Typed Call-by-Value λ-Calculus using a Stack of Regions (MT, JPT), pp. 188–201.
- CADE-1994-Eriksson #calculus #editing #induction #interactive #named
- Pi: an Interactive Derivation Editor for the Calculus of Partial Inductive Definitions (LHE), pp. 821–825.
- CADE-1994-JohannK #constant #order #unification #λ-calculus
- Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading (PJ, MK), pp. 620–634.
- CAV-1994-SokolskyS #calculus #incremental #model checking #μ-calculus
- Incremental Model Checking in the Modal μ-Calculus (OS, SAS), pp. 351–363.
- CAV-1994-VictorM #π-calculus
- The Mobility Workbench — A Tool for the π-Calculus (BV, FM), pp. 428–440.
- ICLP-1994-BelleghemDS #abduction #calculus #representation
- Representing Continuous Change in the Abductive Event Calculus (KVB, MD, DDS), pp. 225–239.
- ILPS-1994-CervesatoCM #calculus
- Modal Event Calculus (IC, LC, AM), p. 675.
- ILPS-1994-KowalskiS #calculus
- The Situation Calculus and Event Calculus Compared (RAK, FS), pp. 539–553.
- LICS-1994-AndersenSW #calculus #composition #proving #μ-calculus
- A Compositional Proof System for the Modal μ-Calculus (HRA, CS, GW), pp. 144–153.
- LICS-1994-AspertiDLR #λ-calculus
- Paths in the λ-calculus (AA, VD, CL, LR), pp. 426–436.
- LICS-1994-Pentus #calculus
- Language Completeness of the Lambek Calculus (MP), pp. 487–496.
- LICS-1994-Wells #decidability #higher-order #λ-calculus
- Typability and Type-Checking in the Second-Order λ-Calculus are Equivalent and Undecidable (JBW), pp. 176–185.
- LICS-1994-ZhangSS #calculus #complexity #model checking #on the #parallel #μ-calculus
- On the Parallel Complexity of Model Checking in the Modal μ-Calculus (SZ, OS, SAS), pp. 154–163.
- PODS-1993-Escobar-MolanoHJ #calculus #query #safety
- Safety and Translation of Calculus Queries with Scalar Functions (MEM, RH, DJ), pp. 253–264.
- SIGMOD-1993-Watters #calculus #relational
- Interpreting a Reconstructed Relational Calculus (Extended Abstract) (AW), pp. 367–376.
- ICALP-1993-CosmoK #confluence #recursion #reduction #λ-calculus
- A Confluent Reduction for the Extensional Typed λ-Calculus with Pairs, Sums, Recursion and terminal Object (RDC, DK), pp. 645–656.
- ICALP-1993-HavelundL #calculus
- The Fork Calculus (KH, KGL), pp. 544–557.
- FME-1993-Ward #calculus #refinement #specification
- Adding Specification Constructors to the Refinement Calculus (NW), pp. 652–670.
- FPCA-1993-Yoshida #reduction #λ-calculus
- Optimal Reduction in Weak-λ-calculus with Shared Environments (NY), pp. 243–254.
- SEKE-1993-Eberbach #algorithm #calculus #design #self #specification
- The Design and Specification of SEMAL — A Cost Language Based on the Calculus of Self-Modifiable Algorithms (EE), pp. 166–173.
- ECOOP-1993-SatohT #calculus #distributed
- A Timed Calculus for Distributed Objects with Clocks (IS, MT), pp. 326–345.
- POPL-1993-Gay #algorithm #π-calculus
- A Sort Inference Algorithm for the Polyadic π-Calculus (SJG), pp. 429–438.
- POPL-1993-OderskyRH #call-by #λ-calculus
- Call by Name, Assignment, and the λ Calculus (MO, DR, PH), pp. 43–56.
- SAC-1993-ClementiniF #calculus #database
- An Object Calculus for Geographic Databases (EC, PDF), pp. 302–308.
FSE-1993-Wood #approach #calculus #re-engineering #refinement #using- A Practical Approach to Software Engineering Using Z and the Refinement Calculus (KRW), pp. 79–88.
- CAV-1993-EmersonJS #calculus #model checking #on the #μ-calculus
- On Model-Checking for Fragments of μ-Calculus (EAE, CSJ, APS), pp. 385–396.
- CSL-1993-AmblerKM #calculus #on the #μ-calculus
- On Duality for the Modal μ-Calculus (SA, MZK, NM), pp. 18–32.
- CSL-1993-OngR #calculus #normalisation
- A Generic Strong Normalization Argument: Application to the Calculus of Constructions (CHLO, ER), pp. 261–279.
- ICLP-1993-PintoR #calculus #logic programming #reasoning
- Temporal Reasoning in Logic Programming: A Case for the Situation Calculus (JP, RR), pp. 203–221.
- ILPS-1993-KohlhaseP #unification #λ-calculus
- Unification in a λ-Calculus with Intersection Types (MK, FP), pp. 488–505.
- ILPS-1993-Li #prolog #specification #π-calculus
- A π-calculus Specification of Prolog (ZL), p. 680.
- RTA-1993-AspertiL #λ-calculus
- Paths, Computations and Labels in the λ-Calculus (AA, CL), pp. 152–167.
- TLCA-1993-Akama #calculus #on the #reduction
- On Mints’ Reduction for ccc-Calculus (YA), pp. 1–12.
- TLCA-1993-BentonBPH #calculus #linear #logic
- A Term Calculus for Intuitionistic Linear Logic (PNB, GMB, VdP, MH), pp. 75–90.
- TLCA-1993-CastagnaGL #calculus #semantics
- A Semantics for λ&-early: A Calculus with Overloading and Early Binding (GC, GG, GL), pp. 107–123.
- TLCA-1993-Dowek #calculus
- The Undecidability of Typability in the λ-π-Calculus (GD), pp. 139–145.
- TLCA-1993-LeivantM #λ-calculus
- λ calculus characterizations of poly-time (DL, JYM), pp. 274–288.
- PODS-1992-Ross #algebra #calculus
- Relations with Relation Names as Arguments: Algebra and Calculus (KAR), pp. 346–353.
- PEPM-1992-Mogensen #partial evaluation #self #λ-calculus
- Self-applicable Partial Evaluation for Pure λ Calculus (TÆM), pp. 116–121.
- WSA-1992-CorsiniMR #calculus #finite #prolog #semantics #μ-calculus
- The μ-Calculus over Finite Domains as an Abstract Semantics of Prolog (MMC, KM, AR), pp. 51–59.
- ICALP-1992-Ong #lazy evaluation #modelling #λ-calculus
- Lazy λ Calculus: Theories, Models and Local Structure Characterization (Extended Abstract) (CHLO), pp. 487–498.
- LFP-1992-BoveA #calculus #confluence #evaluation #metaprogramming
- A Confluent Calculus of Macro Expansion and Evaluation (AB, LA), pp. 278–287.
- LFP-1992-CastagnaGL #calculus #type system
- A Calculus for Overloaded Functions with Subtyping (GC, GG, GL), pp. 182–192.
- ALP-1992-Ait-Kaci #calculus #object-oriented
- Outline of an Object-Oriented Calculus of Higher Type (Abstract) (HAK), pp. 1–2.
- ALP-1992-LaneveM #axiom #equivalence #permutation #λ-calculus
- Axiomatizing Permutation Equivalence in the λ-Calculus (CL, UM), pp. 350–363.
- CADE-1992-BenhamouS #calculus #symmetry
- Theoretical Study of Symmetries in Propositional Calculus and Applications (BB, LS), pp. 281–294.
- CADE-1992-Shankar #calculus #proving
- Proof Search in the Intuitionistic Sequent Calculus (NS), pp. 522–536.
- CAV-1992-CleavelandKS #calculus #model checking #performance #μ-calculus
- Faster Model Checking for the Modal μ-Calculus (RC, MK, BS), pp. 410–422.
- CSL-1992-BentonBPH #linear #modelling #revisited #λ-calculus
- Linear λ-Calculus and Categorial Models Revisited (PNB, GMB, VdP, MH), pp. 61–84.
- CSL-1992-BerarducciB #normalisation #self #λ-calculus
- A Self-Interpreter of λ Calculus Having a Normal Form (AB, CB), pp. 85–99.
- LICS-1992-LiguoroPS #λ-calculus
- Retracts in simply typed λβη-calculus (Ud, AP, RS), pp. 461–469.
- LICS-1992-LincolnM #aspect-oriented #linear #λ-calculus
- Operational aspects of linear λ calculus (PL, JCM), pp. 235–246.
- LICS-1992-Pratt #calculus
- Origins of the Calculus of Binary Relations (VRP), pp. 248–254.
- LICS-1992-Sangiorgi #concurrent #lazy evaluation #λ-calculus
- The Lazy λ Calculus in a Concurrency Scenario (Extended Abstract) (DS), pp. 102–109.
- LICS-1992-Stark #calculus #data flow #network
- A Calculus of Dataflow Networks (Extended Abstract) (EWS), pp. 125–136.
- PEPM-1991-MichaylovP #compilation #polymorphism #λ-calculus
- Compiling the Polymorphic λ-Calculus (SM, FP), pp. 285–296.
- ICALP-1991-CurienC #reduction #λ-calculus
- A Concluent Reduction for the λ-Calculus with Surjective Pairing and Terminal Object (PLC, RDC), pp. 291–302.
- VDME-1991-2-Woodcock #calculus #refinement #tutorial
- A Tutorial on the Refinement Calculus (JW), pp. 79–140.
- VDME-1991-2-Woodcock91a #calculus #refinement
- The Refinement Calculus (JW), pp. 80–95.
- FPCA-1991-FrandsenS #implementation #performance #question #what #λ-calculus
- What is an Efficient Implementation of the λ-calculus? (GSF, CS), pp. 289–312.
- ECOOP-1991-HondaT #calculus #communication
- An Object Calculus for Asynchronous Communication (KH, MT), pp. 133–147.
- POPL-1991-CrankF #λ-calculus
- Parameter-Passing and the λ Calculus (EC, MF), pp. 233–244.
- POPL-1991-HarperP #calculus #symmetry
- A Record Calculus Based on Symmetric Concatenation (RH, BCP), pp. 131–142.
- CAV-1991-CleavelandS #algorithm #calculus #linear #model checking #μ-calculus
- A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal μ-Calculus (RC, BS), pp. 48–58.
- LICS-1991-Audebaud #calculus
- Partial Objects in the Calculus of Constructions (PA), pp. 86–95.
- LICS-1991-BergerS #evaluation #functional #λ-calculus
- An Inverse of the Evaluation Functional for Typed λ-calculus (UB, HS), pp. 203–211.
- LICS-1991-MalacariaR #algebra #λ-calculus
- Some Results on the Interpretation of λ-calculus in Operator Algebras (PM, LR), pp. 63–72.
- LICS-1991-Pfenning #anti #calculus #unification
- Unification and Anti-Unification in the Calculus of Constructions (FP), pp. 74–85.
- LICS-1991-Tronci #equation #λ-calculus
- Equational Prgoramming in λ-calculus (ET), pp. 191–202.
- RTA-1991-Dougherty #algebra #λ-calculus
- Adding Algebraic Rewriting to the Untyped λ Calculus (Extended Abstract) (DJD), pp. 37–48.
- PODS-1990-Willard #algorithm #calculus #relational
- Quasilinear Algorithms for Processing Relational Calculus Expressions (DEW), pp. 243–257.
- ICALP-1990-JagadeesanP #calculus #formal method #higher-order #process
- A Domain-Theoretic Model for a Higher-Order Process Calculus (RJ, PP), pp. 181–194.
- VDME-1990-Hall #calculus #object-oriented #specification #using
- Using Z as a Specification Calculus for Object-Oriented Systems (AH), pp. 290–318.
- VDME-1990-King #calculus #refinement
- Z and the Refinement Calculus (SK), pp. 164–188.
- LFP-1990-FieldT #incremental #reduction #λ-calculus
- Incremental Reduction in the λ Calculus (JF, TT), pp. 307–322.
- ALP-1990-SimonisD #calculus #problem
- Propositional Calculus Problems in CHIP (HS, MD), pp. 189–203.
- PLILP-1990-Asperti #calculus #evaluation #lazy evaluation #strict
- Integrating Strict and Lazy Evaluation: The λ-sl-Calculus (AA), pp. 238–254.
- POPL-1990-Lamping #algorithm #reduction #λ-calculus
- An Algorithm for Optimal λ Calculus Reduction (JL), pp. 16–30.
- CADE-1990-FeltyM #encoding #logic programming #programming language #λ-calculus
- Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language (APF, DM), pp. 221–235.
- CAV-1990-Langevin #automation #calculus #verification
- Automated RTL Verification Based on Predicate Calculus (ML), pp. 116–125.
- LICS-1990-GuzmanH #polymorphism #thread #λ-calculus
- Single-Threaded Polymorphic λ Calculus (JCG, PH), pp. 333–343.
- LICS-1990-KfouryT #polymorphism #re-engineering #summary #λ-calculus
- Type Reconstruction in Finite-Rank Fragments of the Polymorphic λ-Calculus (Extended Summary) (AJK, JT), pp. 2–11.
- LICS-1990-LassezM #calculus #constraints
- A Constraint Sequent Calculus (JLL, KM), pp. 52–61.
- ICALP-1989-Winskel #calculus #model checking
- A Note on Model Checking the Modal nu-Calculus (GW), pp. 761–772.
- KR-1989-Pednault #calculus #named
- ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus (EPDP), pp. 324–332.
- KR-1989-SubramanianW #calculus
- Making Situation Calculus Indexical (DS, JW), pp. 467–474.
- POPL-1989-Paulin-Mohring #calculus #proving #source code
- Extracting Fω’s Programs from Proofs in the Calculus of Constructions (CPM), pp. 89–104.
- POPL-1989-Thomsen #calculus #communication #higher-order
- A Calculus of Higher Order Communicating Systems (BT), pp. 143–154.
ESEC-1989-NardiT #calculus #representation- An Application of the Event Calculus for Representing the History of a Software Project (DN, MT), pp. 176–190.
- CSL-1989-Mey #calculus
- A Predicate Calculus with Control of Derivations (DM), pp. 254–266.
- CSL-1989-Parigot #on the #representation #λ-calculus
- On the Representation of Data in λ-Calculus (MP), pp. 309–321.
- LICS-1989-Luo #calculus
- ECC, an Extended Calculus of Constructions (ZL), pp. 386–395.
- LICS-1989-Moggi #monad #λ-calculus
- Computational λ-Calculus and Monads (EM), pp. 14–23.
- LICS-1989-Vrijer #λ-calculus
- Extending the λ Calculus with Surjective Pairing is Conservative (RCdV), pp. 204–215.
- VDME-1988-BorzyszkowskiKS #formal method #polymorphism #λ-calculus
- A Set-Theoretic Model for a Typed Polymorphic λ Calculus — A Contribution to MetaSoft (AMB, RK, SS), pp. 267–298.
- LFP-1988-Felleisen #named #λ-calculus
- λ-V-CS: An Extended λ-Calculus for Scheme (MF), pp. 72–85.
- POPL-1988-NielsonN #analysis #automation #λ-calculus
- Automatic Binding Time Analysis for a Typed λ-Calculus (HRN, FN), pp. 98–106.
- POPL-1988-Vardi #calculus #fixpoint
- A Temporal Fixpoint Calculus (MYV), pp. 250–259.
- CADE-1988-Ohlbach #calculus #logic
- A Resolution Calculus for Modal Logics (HJO), pp. 500–516.
- CADE-1988-Pfenning #axiom #calculus
- Single Axioms in the Implicational Propositional Calculus (FP), pp. 710–713.
- CSL-1988-Eder #calculus #comparison
- A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods (EE), pp. 80–98.
- JICSCP-1988-Eshghi88 #abduction #calculus
- Abductive Planning with Event Calculus (KE), pp. 562–579.
- LICS-1988-Amadio #fixpoint #higher-order #modelling #λ-calculus
- A fixed point extension of the second order λ-calculus: observable equivalences and models (RMA), pp. 51–60.
- LICS-1988-Bloom #modelling #λ-calculus
- Can LCF Be Topped? Flat Lattice models of Typed λ Calculus (Preliminary Report) (BB), pp. 282–295.
- LICS-1988-BohmP #calculus
- Characterizing X-Separability and One-Side Invertibility in λ-β-Ω-Calculus (CB, AP), pp. 91–101.
- LICS-1988-FreydGSS #parametricity #polymorphism #semantics #λ-calculus
- Semantic Parametricity in Polymorphic λ Calculus (PJF, JYG, AS, PJS), pp. 274–279.
DAC-1987-BeckerHKMO #calculus #design- Hierarchical Design Based on a Calculus of Nets (BB, GH, RK, PM, HGO), pp. 649–653.
- PODS-1987-GelderT #calculus #relational #safety
- Safety and Correct Translation of Relational Calculus Formulas (AVG, RWT), pp. 313–327.
- POPL-1987-FelleisenF #calculus #higher-order
- A Calculus for Assignments in Higher-Order Languages (MF, DPF), pp. 314–325.
- POPL-1987-MeyerMMS #polymorphism #λ-calculus
- Empty Types in Polymorphic λ Calculus (ARM, JCM, EM, RS), pp. 253–262.
- LICS-1987-BohmT #λ-calculus
- X-Separability and Left-Invertibility in λ-calculus (CB, ET), pp. 320–328.
- LICS-1987-FreydS #aspect-oriented #polymorphism #semantics #λ-calculus
- Some Semantic Aspects of Polymorphic λ Calculus (PJF, AS), pp. 315–319.
- LICS-1987-Mendler #constraints #higher-order #recursion #λ-calculus
- Recursive Types and Type Constraints in Second-Order λ Calculus (NPM), pp. 30–36.
- LICS-1987-MitchellM #modelling #λ-calculus
- Kripke-Style models for typed λ calculus (JCM, EM), pp. 303–314.
- SLP-1987-SannellaW87 #calculus #composition #prolog #source code
- A Calculus for the Construction of Modular Prolog Programs (DS, LAW), pp. 368–378.
- PODS-1986-BancilhonK #calculus
- A Calculus for Complex Objects (FB, SK), pp. 53–60.
- POPL-1986-HudakY #analysis #higher-order #strict #λ-calculus
- Higher-Order Strictness Analysis in Untyped λ Calculus (PH, JY), pp. 97–109.
- LICS-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.
- LICS-1986-EmersonL #calculus #model checking #performance #μ-calculus
- Efficient Model Checking in Fragments of the Propositional μ-Calculus (Extended Abstract) (EAE, CLL), pp. 267–278.
- LICS-1986-Mohring #algorithm #calculus #development
- Algorithm Development in the Calculus of Constructions (CM), pp. 84–91.
- LICS-1986-RoundsK #calculus #logic #representation
- A Complete Logical Calculus for Record Structures Representing Linguistic Information (WCR, RTK), pp. 38–43.
- RTA-1985-Zaionc #regular expression #set #λ-calculus
- The Set of Unifiers in Typed λ-Calculus as Regular Expression (MZ), pp. 430–440.
- SIGMOD-1984-Willard #calculus #performance #query #relational #using
- Efficient Processing of Relational Calculus Expressions Using Range Query Theory (DEW), pp. 164–175.
- ICALP-1984-StreettE #calculus #μ-calculus
- The Propositional μ-Calculus is Elementary (RSS, EAE), pp. 465–472.
- CADE-1984-Gelder #calculus #satisfiability
- A Satisfiability Tester for Non-Clausal Propositional Calculus (AVG), pp. 101–112.
- DAC-1983-Bhavsar #algorithm #calculus #design
- Design For Test Calculus: An algorithm for DFT rules checking (DKB), pp. 300–307.
- SIGMOD-1982-BernsteinB #calculus #performance #quantifier #relational #testing
- Fast Methods for Testing Quantified Relational Calculus Assertions (PAB, BTB), pp. 39–50.
VLDB-1982-LouisP #calculus #relational #semantics- A Denotational Definition of the Semantics of DRC, A Domain Relational Calculus (GL, AP), pp. 348–356.
- ICALP-1982-BerklingF #functional #programming language #λ-calculus
- A Modification of the λ-Calculus as a Base for Functional Programming Languages (KJB, EF), pp. 35–47.
- ICALP-1982-Kozen #calculus #μ-calculus
- Results on the Propositional μ-Calculus (DK), pp. 348–359.
- STOC-1981-KrishnamurthyM #calculus
- Examples of Hard Tautologies in the Propositional Calculus (BK, RNM), pp. 28–37.
- VLDB-1980-Demolombe #calculus #estimation #query #tuple
- Estimation of the Number of Tuples Satisfying a Query Expressed in Predicate Calculus Language (RD), pp. 55–63.
SDCG-1980-Schmidt #λ-calculus- State transition machines for λ calculus expressions (DAS), pp. 415–440.
- CADE-1980-Nederpelt #approach #proving #theorem proving #λ-calculus
- An Approach to Theorem Proving on the Basis of a Typed Lambda-Calculus (RN), pp. 182–194.
- VLDB-1979-Demolombe #calculus #semantics
- Semantic Checking of Questions Expressed in Predicate Calculus Language (RD), pp. 444–450.
- ICALP-1979-CoppoDS #functional #semantics #λ-calculus
- Functional Characterization of Some Semantic Equalities inside λ-Calculus (MC, MDC, PS), pp. 133–146.
- ICALP-1978-CoppoDR #finite #set #λ-calculus
- (Semi)-separability of Finite Sets of Terms in Scott’s D∞-Models of the λ-Calculus (MC, MDC, SRDR), pp. 142–164.
- GG-1978-Staples #reduction #λ-calculus
- A Graph-Like λ Calculus for Which Leftmost-Overmost Reduction is Optimal (JS), pp. 440–455.
- ICALP-1977-BohmCD #termination #testing #λ-calculus
- Termination Tests inside λ-Calculus (CB, MC, MDC), pp. 95–110.
- STOC-1975-Cook #calculus #proving
- Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version) (SAC), pp. 83–97.
- STOC-1974-CookR #calculus #on the #proving
- On the Lengths of Proofs in the Propositional Calculus (Preliminary Version) (SAC, RAR), pp. 135–148.
- ICALP-1972-BakkerR #calculus #recursion
- A Calculus for Recursive Program Schemes (JWdB, WPdR), pp. 167–196.
- SIGFIDET-1971-Codd #calculus #database #relational
- A Database Sublanguage Founded on the Relational Calculus (EFC), pp. 35–68.
