Matilda of Boulogne, Duchess of Brabant
Matilda of Boulogne (1170 – 16 October 1210) was the younger daughter of Matthew, Count of Boulogne and Marie I, Countess of Boulogne.[1] Matilda became Duchess of Brabant by her marriage to Henry I, Duke of Brabant.[2]
Matilde of Boulogne | |
---|---|
![]() | |
Born | 1170 |
Died | 16 October 1210 |
Buried | St. Peter's Church, Leuven |
Noble family | House of Lorraine |
Spouse(s) | Henry I, Duke of Brabant |
Issue | |
Father | Matthew, Count of Boulogne |
Mother | Marie I, Countess of Boulogne |
Matilda's parents' marriage was annulled the year she was born and her mother became a Benedictine nun at St. Austrebert, Montreuil and died in 1182.[3] Matilde's father continued to reign as Count of Boulogne until his death in 1173, when her older sister Ida became countess.
At the age of nine, Matilda married Henry I, Duke of Brabant, in 1179. The couple went on to have:
- Maria (c. 1190 – May 1260), married in Maastricht after 19 May 1214 Otto IV, Holy Roman Emperor, married July 1220 Count William I of Holland
- Adelaide (b. c. 1190), married 1206 Arnold III, Count of Loos, married 3 February 1225 William X of Auvergne (c. 1195–1247), married before 21 April 1251 Arnold van Wesemaele (d. aft. 1288)
- Margaret (1192–1231), married January 1206 Gerard III, Count of Guelders (d. 22 October 1229)
- Mathilde (c. 1200 – 22 December 1267), married in Aachen in 1212 Henry II, Count Palatine of the Rhine (d. 1214), married on 6 December 1214 Floris IV, Count of Holland
- Henry II of Brabant (1207–1248), married firstly before 22 August 1215 Marie of Hohenstaufen; married secondly in 1240 Sophie of Thuringia
- Godfrey (1209 – 21 January 1254), Lord of Gaesbeek, married Maria van Oudenaarde
- child, whose name and sex is unknown
Matilde died in 1210 or 1211. She was buried at St. Peter's in Leuven.
Ancestry
Ancestors of Matilda of Boulogne, Duchess of Brabant | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
gollark: All numbers are two's complement because bee you.
gollark: The rest of the instruction consists of variable-width (for fun) target specifiers. The first N target specifiers in an operation are used as destinations and the remaining ones as sources. N varies per opcode. They can be of the form `000DDD` (pop/push from/to stack index DDD), `001EEE` (peek stack index EEE if source, if destination then push onto EEE if it is empty), `010FFFFFFFF` (8-bit immediate value FFFFFFFF; writes are discarded), `011GGGGGGGGGGGGGGGG` (16-bit immediate value GGGGGGGGGGGGGGGG; writes are also discarded), `100[H 31 times]` (31-bit immediate because bee you), `101IIIIIIIIIIIIIIII` (16 bits of memory location relative to the base memory address register of the stack the operation is conditional on), `110JJJJJJJJJJJJJJJJ` (16 bit memory location relative to the top value on that stack instead), `1111LLLMMM` (memory address equal to base memory address of stack LLL plus top of stack MMM), or `1110NNN` (base memory address register of stack MMM).Opcodes (numbered from 0 in order): MOV (1 source, as many destinations as can be parsed validly; the value is copied to all of them), ADD (1 destination, multiple sources), JMP (1 source), NOT (same as MOV), WR (write to output port; multiple sources, first is port number), RE (read from input port; one source for port number, multiple destinations), SUB, AND, OR, XOR, SHR, SHL (bitwise operations), MUL, ROR, ROL, NOP, MUL2 (multiplication with two outputs).
gollark: osmarksISA™️-2028 is a VLIW stack machine. Specifically, it executes a 384-bit instruction composed of 8 48-bit operations in parallel. There are 8 stacks, for safety. Each stack also has an associated base memory address register, which is used in some "addressing modes". Each stack holds 64-bit integers; popping/peeking an empty stack simply returns 0, and the stacks can hold at most 32 items. Exceeding a stack's capacity is runtime undefined behaviour. The operation encoding is: `AABBBCCCCCCCCC`:A = 2-bit conditional operation mode - 0 is "run unconditionally", 1 is "run if top value on stack is 0", 2 is "run if not 0", 3 is "run if first bit is ~~negative~~ 1".B = 3-bit index for the stack to use for the conditional.C = 9-bit opcode (for extensibility).
gollark: By "really fast", I mean "in a few decaminutes, probably".
gollark: I suppose I could just specify it really fast.
References
- McDougal 2017, p. 204.
- Pollock 2015, p. 10.
- Burgess & Busby 1986, p. 19.
Sources
- The Lais of Marie de France. Translated by Burgess, Glyn S.; Busby, Keith. Penguin. 1986.CS1 maint: ref=harv (link)
- Pollock, M.A. (2015). Scotland, England and France after the Loss of Normandy, 1204-1296. The Boydell Press.CS1 maint: ref=harv (link)
- McDougall, Sara (2017). Royal Bastards: The Birth of Illegitimacy, 800-1230. Oxford University Press.CS1 maint: ref=harv (link)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.