Extensional concepts in intensional type theory
M Hofmann - 1995 - era.ed.ac.uk
Theories of dependent types have been proposed as a foundation of constructive
mathematics and as a framework in which to construct certified programs. In these …
mathematics and as a framework in which to construct certified programs. In these …
[图书][B] Extensional constructs in intensional type theory
M Hofmann - 2012 - books.google.com
Extensional Constructs in Intensional Type Theory presents a novel approach to the
treatment of equality in Martin-Loef type theory (a basis for important work in mechanised …
treatment of equality in Martin-Loef type theory (a basis for important work in mechanised …
The definition of Extended ML: A gentle introduction
S Kahrs, D Sannella, A Tarlecki - Theoretical Computer Science, 1997 - Elsevier
Extended ML (EML) is a framework for the formal development of modular Standard ML
(SML) software systems. Development commences with a specification of the behaviour …
(SML) software systems. Development commences with a specification of the behaviour …
Essential concepts of algebraic specification and program development
D Sannella, A Tarlecki - Formal Aspects of Computing, 1997 - Springer
The main ideas underlying work on the model-theoretic foundations of algebraic
specification and formal program development are presented in an informal way. An attempt …
specification and formal program development are presented in an informal way. An attempt …
Toward formal development of programs from algebraic specifications: parameterisation revisited
D Sannella, S Sokolowski, A Tarlecki - Acta Informatica, 1992 - Springer
Parameterisation is an important mechanism for structuring programs and specifications into
modular units. The interplay between parameterisation (of programs and of specifications) …
modular units. The interplay between parameterisation (of programs and of specifications) …
The fork calculus
K Havelund, KG Larsen - International Colloquium on Automata …, 1993 - Springer
Abstract The Fork Calculus FC presents a theory of communicating systems in family with
CCS, but it differs in the way that processes are put in parallel. In CCS there is a binary …
CCS, but it differs in the way that processes are put in parallel. In CCS there is a binary …
Semantic casts: Contracts and structural subtyping in a nominal world
Nominal subtyping forces programmers to explicitly state all of the subtyping relationships in
the program. This limits component reuse, because programmers cannot anticipate all of the …
the program. This limits component reuse, because programmers cannot anticipate all of the …
Extended ML: past, present and future
D Sannella, A Tarlecki - Workshop on the Specification of Abstract Data …, 1990 - Springer
An overview of past, present and future work on the Extended ML formal program
development framework is given, with emphasis on two topics of current active research: the …
development framework is given, with emphasis on two topics of current active research: the …
A module calculus for pure type systems
J Courant - International Conference on Typed Lambda Calculi …, 1997 - Springer
Several proof-assistants rely on the very formal basis of Pure Type Systems (PTS). However,
some practical issues raised by the development of large proofs lead to add other features to …
some practical issues raised by the development of large proofs lead to add other features to …
Algebraic specification and program development by stepwise refinement
D Sannella - … Workshop on Logic Programming Synthesis and …, 1999 - Springer
LNCS 1817 - Algebraic Specification and Program Development by Stepwise Refinement
Page 1 Algebraic Specification and Program Development by Stepwise Refinement …
Page 1 Algebraic Specification and Program Development by Stepwise Refinement …