22 papers:
FoSSaCS-2010-TsukadaK #infinity #recursion- Untyped Recursion Schemes and Infinite Intersection Types (TT, NK), pp. 343–357.
ICFP-2010-Tobin-HochstadtF #logic- Logical types for untyped languages (STH, MF), pp. 117–128.
POPL-2010-WrigstadNLOV #scripting language- Integrating typed and untyped code in a scripting language (TW, FZN, SL, JÖ, JV), pp. 377–388.
CSL-2010-Pous #algebra #linear #logic #proving- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic (DP), pp. 484–498.
ESOP-2006-KoutavasW #bisimulation #imperative- Bisimulations for Untyped Imperative Objects (VK, MW), pp. 146–161.
IJCAR-2006-Brown #set #type system- Combining Type Theory and Untyped Set Theory (CEB), pp. 205–219.
TLCA-2005-AbelC #algorithm #framework #logic #similarity- Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs (AA, TC), pp. 23–38.
- FoSSaCS-2004-FilinskiR #evaluation #normalisation
- A Denotational Account of Untyped Normalization by Evaluation (AF, HKR), pp. 167–181.
RTA-2004-JonesB #analysis #calculus #termination- Termination Analysis of the Untyped lamba-Calculus (NDJ, NB), pp. 1–23.
ECOOP-2003-JagadeesanJR #aspect-oriented #calculus #source code- A Calculus of Untyped Aspect-Oriented Programs (RJ, AJ, JR), pp. 54–73.
PEPM-2000-Taha #formal method #ml #multi #reduction #semantics- A Sound Reduction Semantics for Untyped CBN Multi-stage Computation. Or, the Theory of MetaML is Non-trivial (Extended Abstract) (WT), pp. 34–43.
- PEPM-1999-Mogensen #λ-calculus
- Gödelization in the Untyped λ-Calculus (TÆM), pp. 19–24.
- TLCA-1999-GianantonioFH #game studies #semantics #λ-calculus
- Game Semantics for Untyped λβη-Calculus (PDG, GF, FH), pp. 114–128.
SAS-1996-Venet #alias #analysis #source code- Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs (AV), pp. 366–382.
- 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.
JICSLP-1992-MartensS #metaprogramming #semantics- A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming (BM, DDS), pp. 511–525.
- RTA-1991-Dougherty #algebra #λ-calculus
- Adding Algebraic Rewriting to the Untyped λ Calculus (Extended Abstract) (DJD), pp. 37–48.
LFP-1990-Consel #analysis #functional #higher-order- Binding Time Analysis for High Order Untyped Functional Languages (CC), pp. 264–272.
- LFP-1990-Gomard #functional #source code #type inference
- Partial Type Inference for Untyped Functional Programs (CKG), pp. 282–287.
PODS-1989-HullS #query #set- Untyped Sets, Invention, and Computable Queries (RH, JS), pp. 347–359.
- POPL-1986-HudakY #analysis #higher-order #strict #λ-calculus
- Higher-Order Strictness Analysis in Untyped λ Calculus (PH, JY), pp. 97–109.
