Cayenne

swMATH9686MaRDI QIDQ21665FDOQ21665

Author name not available (Why is that?)

Official website: http://link.springer.com/chapter/10.1007/10704973_6

Cited In (42)

• A Dependently Typed Framework for Static Analysis of Program Execution Costs
• A type system for reflective program generators
• Title not available (Why is that?)
• Generic programming with dependent types
• Program calculation in Coq
• Adapting functional programs to higher order logic
• Self-certification: bootstrapping certified typecheckers in F\(^\ast\) with Coq
• Testing and Proving Distributed Algorithms in Constructive Type Theory
• Dependently typed array programs don't go wrong
• Introducing VAUCANSON
• Dependent ML An approach to practical programming with dependent types
• A language-based approach to functionally correct imperative programming
• Automation for dependently typed functional programming
• Cayenne -- a language with dependent types
• On irrelevance and algorithmic equality in predicative type theory
• Type checking dependent (record) types and subtyping
• Unified syntax with iso-types
• The calculus of dependent lambda eliminations
• Vaucanson
• Plastic
• Type-level computation using narrowing in \(\Omega\)mega
• A partial type checking algorithm for Type:Type
• AURA
• ALF
• Metaphor
• Epigram
• AoPA
• LEGO
• RATH-Agda
• RepLib
• MicroRogue
• SAFL
• AURA
• Language-based program verification via expressive types
• Regexp
• Secure distributed programming with value-dependent types
• Cayenne -- a language with dependent types
• Advanced Functional Programming
• Constructive membership predicates as index types
• Algebra of programming in Agda: Dependent types for relational program derivation
• Imperative LF meta-programming
• A mechanised abstract formalisation of concept lattices

This page was built for software: Cayenne