Sciweavers

1021 search results - page 7 / 205
» Pure Subtype Systems
Sort
View
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
14 years 13 days 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
HOTOS
2007
IEEE
13 years 11 months ago
Purely Functional System Configuration Management
System configuration management is difficult because systems evolve in an undisciplined way: packages are upgraded, configuration files are edited, and so on. The management of ex...
Eelco Dolstra, Armijn Hemel
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 7 months ago
Pure Type Systems without Explicit Contexts
We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of the shape A : B, our systems just have judgments of the ...
Herman Geuvers, Robbert Krebbers, James McKinna, F...
BIRTHDAY
2004
Springer
14 years 1 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
POPL
2003
ACM
14 years 8 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...