researchr - search publication untyped languages

researchr

You are not signed in
Sign in
Sign up

14 publication results matching 'untyped languages'

Type-Checking in an Untyped LanguageAllan Ramsay. ijmms, 20(2):157-167, 1984.
Adding types to untyped languagesMatthias Felleisen. tldi 2010: 1-2 [doi]
Logical types for untyped languagesSam Tobin-Hochstadt, Matthias Felleisen. ICFP 2010: 117-128 [doi]
A Partial Evaluator for the Untyped lambda-Calculus
This article describes theoretical and practical aspects of an implemented self-applicable partial evaluator for the untyped lambda-calculus with constants ... compilers from a denotational or interpretive specification of a programming languageCarsten K. Gomard, Neil D. Jones. JFP, 1(1):21-69, 1991. [doi]
Binding Time Analysis for High Order Untyped Functional Languages interpretation, we present a binding time analysis for an untyped functional language which provides an effective treatment of both higher order functions ... functional languages such as Haskell. Our approach and the system we haveCharles Consel. lfp 1990: 264-272 [doi]
Integrating typed and untyped code in a scripting languageTobias Wrigstad, Francesco Zappa Nardelli, Sylvain Lebresne, Johan Ã–stlund, Jan Vitek. POPL 2010: 377-388 [doi]
A Type Based Debugging Tool for Untyped Logic LanguagesUlrich Geske, Mario Lenz. ICLP 1994:
Languages as libraries sister language to Racket's untyped base language.

This paper explains ... of untyped Racket. Furthermore, modules in this typed language can safely exchange values with untyped modules. Last but not least, the implementation includesTobin-Hochstadt, Sam, St-Amour, Vincent, Culpepper, Ryan, Flatt, Matthew, Matthias Felleisen. In Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation. 2011: 132-141 [doi]
Types and Programming LanguagesBenjamin C. Pierce. MIT Press, Cambridge, Massachusetts, 2002.
A verified compiler for an impure functional language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions ... languages. Compilation is staged and includes standard phases like translationAdam J. Chlipala. POPL 2010: 93-106 [doi]
Polyvariant Binding-Time Analysis For Applicative Languages for applicative languages. This analysis is polyvariant and treats both higher-order functions and data structures. It handles typed as well as untyped programs. It has ... the degree of polyvariance. •Untyped as well as typed programs are treated by ourCharles Consel. PEPM 1993: 66-77 [doi]
Cogen in Six Lines
We have designed and implemented a program-generator generator (PGG) for an untyped higher-order functional programming language. The program generators perform continuation-based multi-level offline specialization and thus combinePeter Thiemann. ICFP 1996: 180-189
Automatic Online Partial Evaluation
We have solved the problem of constructing a fully automatic online program specializer for an untyped functional language (specifically, the functional ... programming language. Producing graphs rather than program text solves problemsDaniel Weise, Roland Conybeare, Erik Ruf, Scott Seligman. fpca 1991: 165-191 [doi]
On Understanding Types, Data Abstraction, and Polymorphism of production programming languages. The evolution of languages from untyped universes ...
Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recentLuca Cardelli, Peter Wegner. ACM Comput. Surv., 17(4):471-522, 1985.

Sign in or sign up to see more results.