Sciweavers

526 search results - page 15 / 106
» Type Abstractions of Name-Passing Processes
Sort
View
POPL
2010
ACM
14 years 6 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
AFP
2004
Springer
14 years 2 months ago
A Functional Shell That Operates on Typed and Compiled Applications
Abstract. Esther is the interactive shell of Famke, a prototype implementation of a strongly typed operating system written in the functional programming language Clean. As usual, ...
Rinus Plasmeijer, Arjen van Weelden
LFP
1992
140views more  LFP 1992»
13 years 9 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
TACAS
1999
Springer
81views Algorithms» more  TACAS 1999»
14 years 25 days ago
Process Algebra in PVS
The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the ver...
Twan Basten, Jozef Hooman
BIRTHDAY
2009
Springer
14 years 3 months ago
Mobile Processes and Termination
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...