41 papers:
DLT-2015-Dehornoy #bibliography #normalisation #polynomial- Garside and Quadratic Normalisation: A Survey (PD), pp. 14–45.
PEPM-J-2013-Garcia-PerezN14 #automaton #functional #hybrid #on the- On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines (ÁGP, PN), pp. 176–199.
ICML-c2-2014-KnowlesGP #infinity #metric #normalisation #random #using- A reversible infinite HMM using normalised random measures (DAK, ZG, KP), pp. 1998–2006.
LICS-CSL-2014-GuenotS #logic #normalisation #symmetry- Symmetric normalisation for intuitionistic logic (NG, LS), p. 10.
- PEPM-2013-Garcia-PerezN #functional #reduction #semantics
- A syntactic and functional correspondence between reduction semantics and reduction-free full normalisers (ÁGP, PN), pp. 107–116.
CSL-2013-Kikuchi #nondeterminism #normalisation #proving #λ-calculus- Proving Strong Normalisation via Non-deterministic Translations into Klop’s Extended λ-Calculus (KK), pp. 395–414.
TLCA-2013-FridlenderP #algorithm #evaluation #normalisation #type system- A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation (DF, MP), pp. 140–155.
ICFP-2012-SeveriV #finite #normalisation #recursion #type system- Pure type systems with corecursion on streams: from finite to infinitary normalisation (PS, FJdV), pp. 141–152.
CIKM-2012-CumminsO #automation #constraints #normalisation- A constraint to automatically regulate document-length normalisation (RC, CO), pp. 2443–2446.
RTA-2012-BonelliKLR #calculus #normalisation- Normalisation for Dynamic Pattern Calculi (EB, DK, CL, AR), pp. 117–132.
ICDAR-2011-GilliamWC #normalisation #segmentation- Segmentation and Normalisation in Grapheme Codebooks (TG, RCW, JAC), pp. 613–617.
FoSSaCS-2011-BernadetL #complexity #normalisation- Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types (AB, SL), pp. 88–107.
ICST-2010-Arcuri #branch #distance #how #matter #testing- It Does Matter How You Normalise the Branch Distance in Search Based Software Testing (AA), pp. 205–214.
ICLP-2009-KoninckDS #normalisation #term rewriting- Demand-Driven Normalisation for ACD Term Rewriting (LDK, GJD, PJS), pp. 484–488.
- FoSSaCS-2008-KikuchiL #normalisation
- Strong Normalisation of Cut-Elimination That Simulates β-Reduction (KK, SL), pp. 380–394.
ECIR-2008-EuachongprasitR #multi #normalisation #performance #retrieval #scalability- Efficient Multimedia Time Series Data Retrieval Under Uniform Scaling and Normalisation (WE, CAR), pp. 506–513.
- RTA-2008-Ketema #combinator #normalisation #on the #reduction
- On Normalisation of Infinitary Combinatory Reduction Systems (JK), pp. 172–186.
- ECIR-2007-HeO #normalisation
- Setting Per-field Normalisation Hyper-parameters for the Named-Page Finding Search Task (BH, IO), pp. 468–480.
- TLCA-2007-SantoMP #calculus #continuation #normalisation
- Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi (JES, RM, LP), pp. 133–147.
- LICS-2006-CoquandS #normalisation #proving #using
- A Proof of Strong Normalisation using Domain Theory (TC, AS), pp. 307–316.
- LICS-2006-TatsutaD #difference #normalisation
- Normalisation is Insensible to λ-Term Identity or Difference (MT, MDC), pp. 327–338.
- ECIR-2005-HeO #modelling #normalisation
- Term Frequency Normalisation Tuning for BM25 and DFR Models (BH, IO), pp. 200–214.
SIGIR-2005-HeO #case study #normalisation- A study of the dirichlet priors for term frequency normalisation (BH, IO), pp. 465–471.
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.
- FoSSaCS-2003-Bonelli #calculus #higher-order #normalisation
- A Normalisation Result for Higher-Order Calculi with Explicit Substitutions (EB), pp. 153–168.
- CSL-2003-Miquel #normalisation #set
- A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory (AM), pp. 441–454.
PPDP-2002-Fiore #analysis #evaluation #normalisation #semantics #λ-calculus- Semantic analysis of normalisation by evaluation for typed λ calculus (MPF), pp. 26–37.
- LICS-2001-YoshidaBH #normalisation #π-calculus
- Strong Normalisation in the π-Calculus (NY, MB, KH), pp. 311–322.
- RTA-2001-KhasidashviliOO #normalisation #orthogonal
- Uniform Normalisation beyond Orthogonality (ZK, MO, VvO), pp. 122–136.
- TLCA-2001-Urban #normalisation
- Strong Normalisation for a Gentzen-like Cut-Elimination Procedure (CU), pp. 415–430.
WRLA-2000-KirchnerG #normalisation #proving #termination- Termination and normalisation under strategy Proofs in ELAN (HK, IG), pp. 93–120.
ICALP-2000-Santo #normalisation- Revisiting the Correspondence between Cut Elimination and Normalisation (JES), pp. 600–611.
- RTA-1999-Groote #deduction #normalisation #on the
- On the Strong Normalisation of Natural Deduction with Permutation-Conversions (PdG), pp. 45–59.
- RTA-1999-Oostrom #normalisation #orthogonal
- Normalisation in Weakly Orthogonal Rewriting (VvO), pp. 60–74.
- TLCA-1999-UrbanB #logic #normalisation
- Strong Normalisation of Cut-Elimination in Classical Logic (CU, GMB), pp. 365–380.
ASF+SDF-1997-MoreauK #commutative #compilation #normalisation- Compilation techniques for associative-commutative normalisation (PEM, HK), p. 11.
- RTA-1997-ArtsG #automation #normalisation #proving
- Proving Innermost Normalisation Automatically (TA, JG), pp. 157–171.
- TLCA-1997-Xi #normalisation #λ-calculus
- Weak and Strong β Normalisations in Typed λ-Calculi (HX), pp. 390–404.
- LICS-1996-AltenkirchHS #normalisation #polymorphism
- Reduction-Free Normalisation for a Polymorphic System (TA, MH, TS), pp. 98–106.
- LICS-1996-Munoz #calculus #confluence #normalisation
- Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus (CAM), pp. 440–447.
- LICS-1994-Marche #normalisation
- Normalised Rewriting and Normalised Completion (CM), pp. 394–403.
