BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
logic (12)
rewrit (11)
system (6)
calculus (5)
term (5)

Stem infinitari$ (all stems)

40 papers:

FoSSaCSFoSSaCS-2015-GrelloisM #linear #logic
An Infinitary Model of Linear Logic (CG, PAM), pp. 41–55.
ICLPICLP-J-2015-CabalarDV #encoding #equilibrium #logic
An infinitary encoding of temporal equilibrium logic (PC, MD, CV), pp. 666–680.
LICSLICS-2015-LagoFVY #parallel
Parallelism and Synchronization in an Infinitary Context (UDL, CF, BV, AY), pp. 559–572.
RTARTA-2015-Czajka #confluence #orthogonal #term rewriting
Confluence of nearly orthogonal infinitary term rewriting systems (LC), pp. 106–126.
RTARTA-2015-EndrullisHHP0 #equation #framework #induction #reasoning
A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (JE, HHH, DH, AP, AS), pp. 143–159.
ICALPICALP-v2-2014-Chaturvedi #towards
Toward a Structure Theory of Regular Infinitary Trace Languages (NC), pp. 134–145.
ICALPICALP-v2-2014-Mazza #λ-calculus
Non-uniform Polytime Computation in the Infinitary Affine λ-Calculus (DM), pp. 305–317.
KRKR-2014-HarrisonLY #semantics
The Semantics of Gringo and Infinitary Propositional Formulas (AJH, VL, FY).
RTARTA-TLCA-2014-Czajka #confluence #induction #proving #λ-calculus
A Coinductive Confluence Proof for Infinitary λ-Calculus (LC), pp. 164–178.
RTARTA-TLCA-2014-LombardiRV #proving
Proof Terms for Infinitary Rewriting (CL, AR, RdV), pp. 303–318.
ICFPICFP-2012-SeveriV #finite #normalisation #recursion #type system
Pure type systems with corecursion on streams: from finite to infinitary normalisation (PS, FJdV), pp. 141–152.
LICSLICS-2012-Mazza #λ-calculus
An Infinitary Affine λ-Calculus Isomorphic to the Full λ-Calculus (DM), pp. 471–480.
RTARTA-2012-Bahr #graph grammar
Infinitary Term Graph Rewriting is Simple, Sound and Complete (PB), pp. 69–84.
RTARTA-2012-Ketema
Reinterpreting Compression in Infinitary Rewriting (JK), pp. 209–224.
RTARTA-2012-SeveriV #combinator #logic #set
Meaningless Sets in Infinitary Combinatory Logic (PS, FJdV), pp. 288–304.
CSLCSL-2011-TatsutaB #commutative
Non-Commutative Infinitary Peano Arithmetic (MT, SB), pp. 538–552.
RTARTA-2011-SeveriV #axiom #λ-calculus
Weakening the Axiom of Overlap in Infinitary λ Calculus (PS, FJdV), pp. 313–328.
LICSLICS-2010-BasaldellaT
Infinitary Completeness in Ludics (MB, KT), pp. 294–303.
RTARTA-2010-Bahr10a #partial order #term rewriting
Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.
RTARTA-2010-EndrullisGHKO #normalisation #orthogonal
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting (JE, CG, DH, JWK, VvO), pp. 85–102.
RTARTA-2010-Kahrs #revisited
Infinitary Rewriting: Foundations Revisited (SK), pp. 161–176.
RTARTA-2010-Simonsen #convergence #normalisation
Weak Convergence and Uniform Normalization in Infinitary Rewriting (JGS), pp. 311–324.
RTARTA-2009-Kahrs #composition #convergence
Modularity of Convergence in Infinitary Rewriting (SK), pp. 179–193.
RTARTA-2008-Ketema #combinator #normalisation #on the #reduction
On Normalisation of Infinitary Combinatory Reduction Systems (JK), pp. 172–186.
ICALPICALP-2007-AtseriasBD07a #equation #logic
Affine Systems of Equations and Counting Infinitary Logic (AA, AAB, AD), pp. 558–570.
RTARTA-2005-KetemaS #combinator #reduction
Infinitary Combinatory Reduction Systems (JK, JGS), pp. 438–452.
RTARTA-2004-Blom #approach #approximate #λ-calculus
An Approximation Based Approach to Infinitary λ Calculi (SB), pp. 221–232.
RTARTA-2004-Simonsen #composition #confluence #on the #term rewriting
On the Modularity of Confluence in Infinitary Term Rewriting (JGS), pp. 185–199.
ICALPICALP-2003-DrosteK
Skew and Infinitary Formal Power Series (MD, DK), pp. 426–438.
CSLCSL-2001-Akama #algebra #combinator #logic #towards #λ-calculus
Limiting Partial Combinatory Algebras towards Infinitary λ-Calculi and Classical Logic (YA), pp. 399–413.
POPLPOPL-1997-NielsonN #analysis #control flow #semantics
Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis (HRN, FN), pp. 332–345.
ICALPICALP-1995-DawarHK #finite #logic
Implicit Definability and Infinitary Logic in Finite Model Theory (AD, LH, PGK), pp. 624–635.
LICSLICS-1995-LynchT #graph #logic #random
The Infinitary Logic of Sparse Random Graphs (JFL, JT), pp. 46–53.
RTARTA-1995-KennawayKSV #modelling #λ-calculus
Infinitary λ Calculi and Böhm Models (RK, JWK, MRS, FJdV), pp. 257–270.
ICALPICALP-1992-KolaitisV #logic
Infinitary Logic for Computer Science (PGK, MYV), pp. 450–473.
LICSLICS-1992-KolaitisV #fixpoint #logic
Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory (PGK, MYV), pp. 46–57.
CSLCSL-1991-Tyszkiewicz #logic #query #transitive
Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic (JT), pp. 396–410.
LICSLICS-1990-KolaitisV #logic
0-1 Laws for Infinitary Logics (Preliminary Report) (PGK, MYV), pp. 156–167.
STOCSTOC-1985-BakkerMOZ #concurrent #semantics
Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency (JWdB, JJCM, ERO, JIZ), pp. 252–262.
ICALPICALP-1982-ComynD #approximate
Approximations of Infinitary Objects (GC, MD), pp. 116–127.

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