Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Search algorithms in type theory

From MaRDI portal
Publication:1575934
Jump to:navigation, search

DOI10.1016/S0304-3975(99)00170-XzbMath0951.68147MaRDI QIDQ1575934

James L. Caldwell, Judith L. Underwood, Ian Philip Gent

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

type theorysearch procedures


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35)


Related Items (2)

Unnamed Item ⋮ Constructive Membership Predicates as Index Types


Uses Software

  • Nuprl
  • LEGO



Cites Work

  • The calculus of constructions
  • A theoretical evaluation of selected backtracking algorithms.
  • A symmetric lambda calculus for classical program extraction
  • Principles and practice of constraint programming -- CP '96. Second international conference, CP '96, Cambridge, MA, USA, August 19--22, 1996. Proceedings
  • Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Search algorithms in type theory

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1575934&oldid=13858098"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 01:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki