MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Lars Birkedal" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 42 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Developing Theories of Types and Computability  
  • by Lars Birkedal — 1998
  • …Introduction Domain Theory, type theory (both in the style of Martin-Lof [40, 41] and in the polymorphic style of Girard/Reynolds [23, 56]), and topos theory (both in the topological/sheaf-theoretic treatments and in the realizability approach going back to the early work of Kleene) have attempted …
  • Cited by 8 (3 self) – Add To MetaCart
  • Developing Theories of Types and Computability  
  • by Thesis Proposal, Lars Birkedal — 1999
  • …Introduction Domain Theory, type theory (both in the style of Martin-Lof [40, 41] and in the polymorphic style of Girard/Reynolds [23, 56]), and topos theory (both in the topological/sheaf-theoretic treatments and in the realizability approach going back to the early work of Kleene) have attempted …
  • Add To MetaCart
  • CATEGORY-THEORETIC MODELS OF LINEAR ABADI & PLOTKIN LOGIC  
  • by Lars Birkedal, Rasmus, E. Møgelberg, Rasmus, L. Petersen
  • …Abstract. This paper presents a sound and complete category-theoretic notion of models for Linear Abadi & Plotkin Logic [Birkedal et al., 2006], a logic suitable for reasoning about parametricity in combination with recursion. A subclass of these called parametric LAPL structures can be seen as an a…
  • Add To MetaCart
  • Binding-Time Analysis for Standard ML  
  • by Lars Birkedal, Morten Welinder — 1995 — Lisp and Symbolic Computation
  • …. We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard ML except modules and we show the principles of how constraints can be used for binding-time analysis of Standard ML; in…
  • Cited by 10 (0 self) – Add To MetaCart
  • Continuous Functionals of Dependent Types and Equilogical Spaces  
  • by Andrej Bauer, Lars Birkedal — 2000
  • …. We show that dependent sums and dependent products of continuous parametrizations on domains with dense, codense, and natural totalities agree with dependent sums and dependent products in equilogical spaces, and thus also in the realizability topos RT(P!). Keywords: continuous functionals, depen…
  • Cited by 12 (8 self) – Add To MetaCart
  • Unification and Polymorphism in Region Inference  
  • by Mads Tofte, Lars Birkedal — 1996 — In Proof, Language, and Interaction: Essays in Honour of Robin Milner
  • …Region Inference is a technique for inferring lifetimes of values in strict, higher-order programming languages such as Standard ML. The purpose of this paper is to show how ideas from Milner's polymorphic type discipline can serve as a basis for region inference, even in the presence of a limited f…
  • Cited by 11 (2 self) – Add To MetaCart
  • A Constraint-Based Region Inference Algorithm  
  • by Lars Birkedal, Mads Tofte — 1999 — Theoretical Computer Science
  • …Region inference is a type-based technique for determining runtime memory management at compile time. It is targeted at a runtime model in which the store consists of a stack of regions and memory management predominantly consists of pushing and popping regions. Region inference has previously been …
  • Cited by 9 (1 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB