Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with dependent-type
Search options not deleted
user 548
Use this tag for questions about dependent types, which are families of types which vary over elements of another type.
4
votes
1
answer
262
views
How can you represent a dependent type visually?
So, obviously for a term $t$ of type $T$, I would represent it as:
T
+-----------+
| |
| t |
| |
+-----------+
That is a node labeled $T$ parenting another node labe …
- 313
1
vote
1
answer
66
views
Terms are not types, but could I have Type be a subclass of Term in my OOP / C++ dependent t...
Here's the code so far in "Type.h".
#pragma once
#include "Term.h"
#include <string>
class Type
{
public:
Type() {
typeName = "Anonymous";
}
Type(const std::string& typeName)
…
- 313
0
votes
Accepted
Terms are not types, but could I have Type be a subclass of Term in my OOP / C++ dependent t...
Have been coding from the book. Here is a sample:
SimplyTypedLambdaCalculus::SimplyTypedLambdaCalculus(const Type* baseType)
{
auto base_type = IsType(baseType);
baseTypeIntro = InferenceRule …
- 313