Sciweavers

308 search results - page 12 / 62
» A Functional Shell That Operates on Typed and Compiled Appli...
Sort
View
126
Voted
ENTCS
2007
102views more  ENTCS 2007»
15 years 2 months ago
Encoding Functional Relations in Scunak
We describe how a set-theoretic foundation for mathematics can be encoded in the new system Scunak. We then discuss an encoding of the construction of functions as functional relat...
Chad E. Brown
134
Voted
LFP
1992
140views more  LFP 1992»
15 years 3 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
114
Voted
USENIX
1996
15 years 4 months ago
A Comparison of OS Extension Technologies
The current trend in operating systems research is to allow applications to dynamically extend the kernel to improve application performance or extend functionality, but the most ...
Christopher Small, Margo I. Seltzer
113
Voted
ICFP
2000
ACM
15 years 6 months ago
Fully reflexive intensional type analysis
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
Valery Trifonov, Bratin Saha, Zhong Shao
126
Voted
ICFP
2001
ACM
16 years 2 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha