Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
64
Effects in functional and dependently-typed programming
"... Effectful programming is supported in Haskell by compilers which provide primitive effectful operations, together with functions to combine these operations into larger programs. Unfortunately, this makes the task of reasoning about the correctness of and understanding the behaviour of programs with ..."
Abstract
- Add to MetaCart
-by-construction programs which are guaranteed to match their specifications. We move on to discuss a potential new model for specifying local state (á la the ST monad), along with an initial prototype in the dependently-typed functional programming language Agda. This model specifies the effect that computations have
Security-Typed Programming within Dependently-Typed Programming
"... Abstract. Several recent security-typed programming languages allow programmers to express and enforce authorization policies governing access to controlled resources. Policies are expressed as propositions in an authorization logic, and enforced by a type system that requires each access to a sensi ..."
Abstract
-
Cited by 21 (2 self)
- Add to MetaCart
Abstract. Several recent security-typed programming languages allow programmers to express and enforce authorization policies governing access to controlled resources. Policies are expressed as propositions in an authorization logic, and enforced by a type system that requires each access to a
Dependently-Typed Formalisation of Typed Term Graphs
"... We employ the dependently-typed programming language Agda2 to explore formalisation of untyped and typed term graphs directly as set-based graph structures, via the gs-monoidal categories of Corradini and Gadducci, and as nested let-expressions using Pouillard and Pottier’s NotSoFresh library of var ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We employ the dependently-typed programming language Agda2 to explore formalisation of untyped and typed term graphs directly as set-based graph structures, via the gs-monoidal categories of Corradini and Gadducci, and as nested let-expressions using Pouillard and Pottier’s NotSoFresh library
Singleton A General-Purpose Dependently-Typed Assembly Language
"... In this paper we present Singleton, a dependently typed assembly language. Based upon the calculus of inductive constructions, Singleton’s type system allows procedures abstracting over terms, types, propositions, and proof terms. Furthermore, Singleton includes generalised singleton types. In addit ..."
Abstract
- Add to MetaCart
In this paper we present Singleton, a dependently typed assembly language. Based upon the calculus of inductive constructions, Singleton’s type system allows procedures abstracting over terms, types, propositions, and proof terms. Furthermore, Singleton includes generalised singleton types
Submitted to ICFP 2010 Security-Typed Programming within Dependently-Typed Programming
"... Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and en-force access control and information flow policies. Most of these security-typed languages have been presented as new, stand-alone language designs. In this paper, we instead show ..."
Abstract
- Add to MetaCart
Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and en-force access control and information flow policies. Most of these security-typed languages have been presented as new, stand-alone language designs. In this paper, we instead show
Dependently-Typed Programming in Scientific Computing - Examples from Economic
- Modelling, IFL (Implementation and Application of Functional Languages) 2012, Lecture Notes in Computer Science
, 2013
"... Abstract. Computer simulations are essential in virtually every scien-tific discipline, even more so in those such as economics or climate change where the ability to make laboratory experiments is limited. Therefore, it is important to ensure that the models are implemented correctly, that they can ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
and the implementation, and we give examples from economic modelling. We discuss the consequences that our incremental approach has on programming style and the requirements it imposes on the dependently-typed programming languages used. 1
Translating a Dependently-Typed Logic to First-Order Logic
"... Abstract. DFOL is a logic that extends first-order logic with dependent types. We give a translation from DFOL to FOL formalized as an institution comorphism and show that it admits the model expansion property. This property together with the borrowing theorem implies the soundness of borrowing — a ..."
Formally-Based Resource Usage Verification using a Dependently-Typed MetaLanguage to Specify and Implement Domain-Specific Languages
, 2007
"... In the modern, multi-threaded, multi-core programming environment, correctly managing system resources such as locks or file handles can be especially difficult and error prone. A simple error, such as forgetting to release a lock, can have major consequences on the correct operation of the program ..."
Abstract
- Add to MetaCart
(e.g. deadlock), often at a time and location that is isolated from the original error. While there have been many previous proposals for managing locks and resources, these often arise from the systems arena, and are therefore integrated only loosely with the host programming language
Practical Dependently-Typed Programming for the Web Correct and Secure Web Programming using Dependent Types and Embedded Domain-Specific Languages
"... Abstract Dependently-typed languages allow very expressive types to be used during development, in turn facilitating easier reasoning about the operation of programs written in such languages. Stronger type specifications do however bring with them the disadvantage that it becomes increasingly diff ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract Dependently-typed languages allow very expressive types to be used during development, in turn facilitating easier reasoning about the operation of programs written in such languages. Stronger type specifications do however bring with them the disadvantage that it becomes increasingly
VeriML: A dependently-typed, user-extensible and language-centric approach to proof assistants
, 2013
"... Software certification is a promising approach to producing programs which are virtually free of bugs. It requires the construction of a formal proof which establishes that the code in question will behave according to its specification – a higher-level description of its functionality. The construc ..."
Abstract
- Add to MetaCart
effort as well. This is due to a profound architectural shortcoming of existing proof assistants: developing automation procedures is currently overly complicated and error-prone. It involves the use of an amalgam of extension languages, each with a different programming model and a set of limitations
Results 1 - 10
of
64
