Sciweavers

1999 search results - page 168 / 400
» Dependently Typed Grammars
Sort
View
ECTEL
2007
Springer
16 years 18 days ago
Resolving Variations in Learning Spaces for Experiential Learning
Today, systems should react based on explicit demands from the learner or even proactively react based on changes in the working environment. The success of this type of systems de...
Eric Ras
CSFW
2006
IEEE
16 years 14 days ago
Securing Interaction between Threads and the Scheduler
The problem of information flow in multithreaded programs remains an important open challenge. Existing approaches to specifying and enforcing information-flow security often su...
Alejandro Russo, Andrei Sabelfeld
PADL
2004
Springer
15 years 11 months ago
Parametric Fortran - A Program Generator for Customized Generic Fortran Extensions
We describe the design and implementation of a program generator that can produce extensions of Fortran that are specialized to support the programming of particular applications. ...
Martin Erwig, Zhe Fu
ICTCS
2003
Springer
15 years 11 months ago
A Calculus for Dynamic Linking
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notion...
Davide Ancona, Sonia Fagorzi, Elena Zucca
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
15 years 11 months ago
Subtyping, Declaratively
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
Nils Anders Danielsson, Thorsten Altenkirch